Search

This paper addresses sustainable workforce scheduling and routing problem (WSRP), in which technicians with different levels of competence are paired into teams to serve customers in different geographic regions-districts within predetermined time windows. We formulate the WSRP as a mixed integer linear programming formulation that covers the decisions such as scheduling, routing, state of charge, and visiting of the charging stations. Furthermore, we developed different objective functions minimizing not only total travelled distance, but also the number of electrical vehicles employed. The performance of the proposed heuristic is tested by using real-world data. In addition, the developed variable neighbourhood search algorithm is compared with the exact solution method and the computational results indicates that the proposed heuristic can yield high quality of solutions. [ABSTRACT FROM AUTHOR]

The article briefly discusses research papers that are contained within the section, titled "Algorithm Design and Scheduling Techniques (Realistic Platform Models) for Heterogeneous Clusters," of this issue. The purpose of these papers is to explore the impact of platform heterogeneity on the design and evaluation of new algorithms, such as, distributed algorithms and scheduling algorithms. One paper by Ligang He and his colleagues discusses two new workload allocation strategies for large-scale heterogeneous platforms. The paper "On the Distribution of Sequential Jobs in Random Brokering for Heterogeneous Computational Grids," by Vandy Berten and colleagues, focuses on resource brokering for scheduling sequential jobs onto a grid platform. In their article, "Multiple Job Scheduling in a Connection-Limited Data Parallel System," authors Alessandro Amoroso and Keith Marzullo describe a new method for scheduling jobs in a distributed system.