Upper bounds on Taillard's benchmark suite for the no-wait flowshop scheduling problem with makespan criterion.
Quan-Ke PanMehmet Fatih TasgetirenYun-Chia LiangPonnuthurai N. SuganthanPublished in: IEEE Congress on Evolutionary Computation (2008)
Keyphrases
- total flowtime
- permutation flowshop
- benchmark suite
- scheduling problem
- upper bound
- flowshop
- flowshop scheduling problems
- lower bound
- single machine
- strongly np hard
- minimizing makespan
- tabu search
- np hard
- processing times
- worst case
- sequence dependent setup times
- greedy algorithm
- setup times
- bicriteria
- total tardiness
- precedence constraints
- lower and upper bounds
- flowshop scheduling
- total weighted tardiness
- maximum lateness
- neural network
- evolutionary algorithm
- maximum tardiness
- identical parallel machines
- job shop
- job shop scheduling problem
- linear programming
- branch and bound algorithm