A note on scheduling identical parallel machines with preemptions and setup times
| Year of publication: |
2025
|
|---|---|
| Authors: | Boudhar, Mourad ; Dolgui, Alexandre ; Haned, Amina ; Kerdali, Abida ; Kovalev, Sergey ; Kovalyov, Mikhail Y. |
| Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 63.2025, 3, p. 1203-1208
|
| Subject: | Parallel machine scheduling | preemptions | setup times | makespan | dynamic programming | FPTAS | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Algorithmus | Algorithm | Dynamische Optimierung | Dynamic programming | Branch-and-Bound | Branch and Bound |
-
Scheduling on identical machines with preemption and setup times
Haned, Amina, (2024)
-
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
Alhadi, Gais, (2020)
-
Luo, JianChao, (2019)
- More ...
-
Scheduling electric vehicle regular charging tasks : a review of deterministic models
Dolgui, Alexandre, (2025)
-
Profitability of a multi-model manufacturing line versus multiple dedicated lines
Dolgui, Alexandre, (2021)
-
Workforce reconfiguration strategies in manufacturing systems : a state of the art
Hashemi-Petroodi, S. Ehsan, (2021)
- More ...