A variable block insertion heuristic for permutation flowshops with makespan criterion.
Mehmet Fatih TasgetirenQuan-Ke PanDamla KizilayMario C. Vélez-GallegoPublished in: CEC (2017)
Keyphrases
- total flowtime
- permutation flowshop
- scheduling problem
- minimizing makespan
- strongly np hard
- flowshop
- squeaky wheel
- tabu search
- unrelated parallel machines
- optimal solution
- processing times
- np hard
- setup times
- scheduling jobs
- single machine
- lower bound
- job shop scheduling problem
- parallel machine scheduling problem
- parallel machines
- upper bound
- variable ordering
- total tardiness
- search algorithm
- simulated annealing
- sequence dependent setup times
- approximation algorithms
- greedy algorithm
- total weighted tardiness
- bicriteria
- solution quality
- special case
- branch and bound algorithm
- maximum lateness
- precedence constraints
- memetic algorithm
- knapsack problem
- lot streaming
- feature selection