|
|
|
|
|
Mauro Dell?Amico, Jafar Jamal and Roberto Montemanni
The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was presente...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jian Li, Huankun Li, Pengbo He, Liping Xu, Kui He and Shanhui Liu
Green manufacturing has become a new production mode for the development and operation of modern and future manufacturing industries. The flexible job shop scheduling problem (FJSP), as one of the key core problems in the field of green manufacturing pro...
ver más
|
|
|
|
|
|
|
|
|
|
|
Athanasios C. Spanos, Sotiris P. Gayialis, Evripidis P. Kechagias and Georgios A. Papadopoulos
In this research, we present a hybrid algorithmic framework and its integration into the precise production scheduling system of a Greek metal forming factory. The system was created as a decision support tool to assist production planners in arranging w...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuri N. Sotskov and Evangelina I. Mihova
This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness ??max
L
max
for integer due dates to the scheduling problem, where along with precedence constraints given on the set ??={??1,??2,??,...
ver más
|
|
|
|
|
|
|
|
|
|
|
Frank Werner, Larysa Burtseva and Yuri N. Sotskov
This special issue of Algorithms is a follow-up issue of an earlier one, entitled ?Algorithms for Scheduling Problems?. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms. Submissions were welcome both...
ver más
|
|
|
|
|
|
|
|
|
|
|
László Nagy, Tamás Ruppert and János Abonyi
Assembly line balancing improves the efficiency of production systems by the optimal assignment of tasks to operators. The optimisation of this assignment requires models that provide information about the activity times, constraints and costs of the ass...
ver más
|
|
|
|
|
|
|
|
|
|
|
Syrine Roufaida Ait Haddadene, Nacima Labadie and Caroline Prodhon
Home Healthcare (HHC) is an emerging and fast-expanding service sector that gives rise to challenging vehicle routing and scheduling problems. Each day, HHC structures must schedule the visits of caregivers to patients requiring specific medical and para...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alessandro Agnetis, Fabrizio Rossi and Stefano Smriglio
We address some special cases of job shop and flow shop scheduling problems with s-precedence constraints. Unlike the classical setting, in which precedence constraints among the tasks of a job are finish?start, here the task of a job cannot start before...
ver más
|
|
|
|
|
|
|
|
|
|
|
Slim Belhaiza
The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). The DARP aims to design pick-up and delivery vehicle routing schedules. Its main objective is to accommodate as many users as possible with a minimum op...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ling Xu, Jianzhong Qiao, Shukuan Lin and Ruihua Qi
In volunteer computing (VC), the expected availability time and the actual availability time provided by volunteer nodes (VNs) are usually inconsistent. Scheduling tasks with precedence constraints in VC under this situation is a new challenge. In this p...
ver más
|
|
|
|
|
|