Approximations for the Two-Machine Cross-Docking Flow Shop Problem.
Damien ProtChristophe RapinePublished in: Discret. Appl. Math. (2013)
Keyphrases
- flowshop
- scheduling problem
- special case
- bicriteria
- flowshop scheduling
- processing times
- makespan minimization
- maximum lateness
- setup times
- sequence dependent setup times
- asymptotic optimality
- minimizing makespan
- unrelated parallel machines
- tabu search
- strongly np hard
- np hard
- robotic cell
- single machine
- open shop
- parallel machines
- job shop
- job shop scheduling problem
- manufacturing cell
- neural network
- completion times
- job shop scheduling
- buffer allocation