New characteristics of optimal solutions for the two-machine flowshop problem with unlimited buffers.
Ghaith RabadiMohamed Kais MsakniElkin Rodriguez-VelasquezWilliam Alvarez-BermudezPublished in: J. Oper. Res. Soc. (2019)
Keyphrases
- flowshop
- scheduling problem
- bicriteria
- optimal solution
- special case
- flowshop scheduling
- minimizing total tardiness
- minimizing makespan
- processing times
- tabu search
- np hard
- sequence dependent setup times
- efficient solutions
- setup times
- flowshop scheduling problems
- total tardiness
- preventive maintenance
- maximum lateness
- parallel machines
- makespan minimization
- metaheuristic
- single machine
- strongly np hard
- feasible solution
- search space
- total cost
- branch and bound algorithm
- total weighted tardiness
- robotic cell
- lower bound
- completion times
- solution quality
- production system
- linear program