No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines.
Nadia BraunerMikhail Y. KovalyovAlain QuilliotHélène ToussaintPublished in: Comput. Oper. Res. (2021)
Keyphrases
- release dates
- processing times
- small number
- setup times
- single machine scheduling problem
- single machine
- scheduling problem
- minimize total
- sequence dependent setup times
- response time
- parallel machines
- parallel machine scheduling problem
- release times
- precedence constraints
- maximum lateness
- identical parallel machines
- scheduling jobs
- total weighted tardiness
- earliness tardiness
- flowshop
- job processing times
- resource consumption
- np hard
- cost function