Hybrid algorithms for the earliness-tardiness single-machine multiple orders per job scheduling problem with a common due date.
Jens RochollLars MönchPublished in: RAIRO Oper. Res. (2018)
Keyphrases
- earliness tardiness
- single machine
- scheduling problem
- processing times
- maximum lateness
- single machine scheduling problem
- release dates
- flowshop
- tardiness cost
- scheduling jobs
- total weighted tardiness
- sequence dependent setup times
- completion times
- setup times
- identical parallel machines
- parallel machines
- np hard
- precedence constraints
- identical machines
- tabu search
- dynamic programming
- branch and bound algorithm
- search procedure
- combinatorial optimization
- linear programming