Minimizing the makespan in a two-machine cross-docking flow shop problem.
Feng ChenChung-Yee LeePublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- flowshop
- scheduling problem
- special case
- flowshop scheduling
- sequence dependent setup times
- setup times
- bicriteria
- minimizing makespan
- asymptotic optimality
- processing times
- tabu search
- robotic cell
- strongly np hard
- flowshop scheduling problems
- maximum lateness
- makespan minimization
- parallel machines
- job shop
- total weighted tardiness
- single machine
- np hard
- buffer allocation
- job shop scheduling
- permutation flowshop
- ant colony optimization
- search space
- expert systems