Batch scheduling in the no-wait two-machine flowshop to minimize the makespan.
Bertrand M. T. LinT. C. Edwin ChengPublished in: Comput. Oper. Res. (2001)
Keyphrases
- flowshop
- scheduling problem
- sequence dependent setup times
- special case
- minimizing total tardiness
- flowshop scheduling
- processing times
- minimizing makespan
- setup times
- single machine
- tabu search
- total tardiness
- bicriteria
- flowshop scheduling problems
- total weighted tardiness
- maximum lateness
- robotic cell
- strongly np hard
- makespan minimization
- np hard
- computational complexity
- cost function
- parallel machines
- feasible solution