A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion.
Yu GaoZiyue WangLiang GaoXinyu LiPublished in: Symmetry (2022)
Keyphrases
- flowshop
- scheduling problem
- total flowtime
- permutation flowshop
- minimizing makespan
- flowshop scheduling problems
- processing times
- single machine
- flowshop scheduling
- setup times
- tabu search
- sequence dependent setup times
- maximum lateness
- bicriteria
- np hard
- parallel machines
- lot streaming
- total tardiness
- precedence constraints
- job shop
- maximum tardiness
- makespan minimization
- open shop
- unrelated parallel machines
- strongly np hard
- special case
- total weighted tardiness
- minimizing total tardiness
- preventive maintenance
- upper bound
- search algorithm
- scheduling jobs
- objective function
- greedy algorithm