Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine.
Gur MosheiovAssaf SarigPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- flowshop
- scheduling problem
- single machine
- weighted number of tardy jobs
- sequence dependent setup times
- bicriteria
- special case
- setup times
- flowshop scheduling
- minimizing makespan
- processing times
- parallel machines
- asymptotic optimality
- tabu search
- maximum lateness
- np hard
- robotic cell
- unrelated parallel machines
- manufacturing cell
- open shop
- makespan minimization
- job shop