Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed.
Chang Sup SungYoung Hwan KimPublished in: Comput. Oper. Res. (2002)
Keyphrases
- minimizing makespan
- flowshop
- scheduling problem
- maximum tardiness
- total flowtime
- processing times
- special case
- parallel machines
- sequence dependent setup times
- bicriteria
- maximum lateness
- flowshop scheduling
- robotic cell
- flowshop scheduling problems
- total tardiness
- setup times
- minimizing total tardiness
- single machine
- tabu search
- preventive maintenance
- precedence constraints
- np hard