Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness.
Ali AllahverdiPublished in: Comput. Oper. Res. (1996)
Keyphrases
- flowshop
- flowshop scheduling
- maximum lateness
- scheduling problem
- completion times
- flowshop scheduling problems
- special case
- sequence dependent setup times
- tabu search
- processing times
- batch processing machines
- single machine
- setup times
- minimizing makespan
- strongly np hard
- parallel machine scheduling problem
- parallel machines
- precedence constraints
- np hard
- markov random field