A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.
C. T. NgT. C. Edwin ChengJinjiang YuanPublished in: Oper. Res. Lett. (2002)
Keyphrases
- maximum lateness
- scheduling problem
- precedence constraints
- single machine
- completion times
- release dates
- sequence dependent setup times
- setup times
- total tardiness
- flowshop
- total weighted tardiness
- processing times
- scheduling jobs
- single machine scheduling problem
- np hard
- parallel machines
- release times
- tardiness cost
- deteriorating jobs
- tabu search
- number of late jobs
- branch and bound algorithm
- dynamic programming
- dominance rules
- job shop scheduling problem
- genetic algorithm
- makespan minimization