Decomposition heuristics for parallel-machine multiple orders per job scheduling problems with a common due date.
Jens RochollLars MönchPublished in: J. Oper. Res. Soc. (2021)
Keyphrases
- scheduling problem
- parallel machines
- list scheduling
- tardiness penalties
- sequence dependent setup times
- flowshop
- earliness tardiness
- release dates
- processing times
- single machine
- parallel machine scheduling problem
- tardiness cost
- greedy heuristics
- maximum lateness
- total tardiness
- job shop
- unrelated parallel machines
- precedence constraints
- scheduling jobs
- setup times
- makespan minimization
- single machine scheduling problem
- total weighted tardiness
- identical parallel machines
- tabu search
- np hard
- lot sizing
- identical machines
- minimizing makespan
- job shop scheduling
- search algorithm
- production scheduling
- random variables
- job shop scheduling problem
- approximation algorithms
- shared memory