A Discrete-Event Heuristic for Makespan Optimization in Multi-Server Flow-Shop Problems with Machine re-entering.
Angel A. JuanPedro CopadoJavier PanaderoChristoph LaroqueRocio de la TorrePublished in: WSC (2020)
Keyphrases
- flowshop
- scheduling problem
- discrete event
- unrelated parallel machines
- tabu search
- strongly np hard
- asymptotic optimality
- processing times
- optimization problems
- flowshop scheduling problems
- bicriteria
- special case
- sequence dependent setup times
- flowshop scheduling
- setup times
- minimizing makespan
- maximum lateness
- combinatorial optimization
- single machine
- simulation model
- job shop scheduling problem
- parallel machines
- total weighted tardiness
- scheduling jobs
- discrete event simulation
- ant colony optimization
- open shop
- batch processing
- dynamic systems
- lower bound
- optimal solution