1. Scheduling on identical machines with preemption and setup times.
- Author
-
Haned, Amina, Kerdali, Abida, and Boudhar, Mourad
- Subjects
SETUP time ,POLYNOMIAL time algorithms ,POLYNOMIAL approximation ,DYNAMIC programming ,GENETIC algorithms - Abstract
In this paper, we address the problem of scheduling jobs on identical machines for minimising the maximum completion time (makespan). Each job requires a sequence-independent setup time, which represents the time needed to prepare the machines for job execution. Then, we introduce a dynamic programme to solve the case with two machines, and show that this problem admits a fully polynomial time approximation scheme. For the case of m machines, we propose heuristics and an adapted genetic algorithm. Some numerical experiments are done to evaluate the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF