Minimizing makespan with multiple-orders-per-job in a two-machine flowshop.
Jeffrey D. LaubJohn W. FowlerAhmet B. KehaPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- flowshop
- minimizing makespan
- scheduling problem
- maximum tardiness
- total flowtime
- special case
- maximum lateness
- flowshop scheduling
- processing times
- tabu search
- bicriteria
- sequence dependent setup times
- setup times
- minimizing total tardiness
- single machine
- np hard
- makespan minimization
- job processing times
- flowshop scheduling problems
- robotic cell
- lot streaming
- preventive maintenance
- completion times
- parallel machines
- strongly np hard
- search algorithm
- neural network
- precedence constraints
- total weighted tardiness
- optimal solution