A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion.
Mehmet Fatih TasgetirenQuan-Ke PanDamla KizilayKaizhou GaoPublished in: Algorithms (2016)
Keyphrases
- total flowtime
- scheduling problem
- flowshop
- permutation flowshop
- maximum tardiness
- minimizing makespan
- tabu search
- strongly np hard
- flowshop scheduling problems
- unrelated parallel machines
- job shop scheduling problem
- single machine
- setup times
- flowshop scheduling
- processing times
- bicriteria
- sequence dependent setup times
- total tardiness
- maximum lateness
- minimizing total tardiness
- special case
- feasible solution
- upper bound
- np hard
- total weighted tardiness
- parallel machines
- optimal solution
- approximation algorithms
- preventive maintenance
- precedence constraints
- search procedure
- simulated annealing
- dynamic programming
- solution quality
- hybrid algorithm
- metaheuristic
- search space
- search algorithm