Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families.
XiaoLin LiYuPeng LiYanLi HuangPublished in: Comput. Oper. Res. (2019)
Keyphrases
- batch processing
- dominance rules
- maximum lateness
- single machine
- lower bound
- scheduling problem
- flowshop
- scheduling jobs
- branch and bound algorithm
- precedence constraints
- parallel machines
- release dates
- completion times
- sequence dependent setup times
- upper bound
- processing times
- single machine scheduling problem
- np hard
- parallel machine scheduling problem
- special case
- batch processing machines
- lower and upper bounds
- optimal solution
- branch and bound
- worst case
- dynamic programming
- tabu search