Hybrid GA-Based Improvement Heuristic with Makespan Criterion for Flow-Shop Scheduling Problems.
Pavol SemancoVladimír ModrákPublished in: CENTERIS (2) (2011)
Keyphrases
- flowshop
- scheduling problem
- total flowtime
- maximum tardiness
- tabu search
- strongly np hard
- asymptotic optimality
- permutation flowshop
- unrelated parallel machines
- minimizing makespan
- list scheduling
- flowshop scheduling problems
- processing times
- single machine
- job shop scheduling problem
- bicriteria
- sequence dependent setup times
- setup times
- parallel machine scheduling problem
- parallel machines
- maximum lateness
- np hard
- special case
- flowshop scheduling
- precedence constraints
- makespan minimization
- scheduling jobs
- genetic algorithm
- total tardiness
- job shop scheduling
- lot streaming
- search procedure
- sequencing problems
- optimal solution
- feasible solution
- total weighted tardiness
- identical parallel machines
- parallel genetic algorithm
- single machine scheduling problem
- memetic algorithm
- genetic algorithm ga
- simulated annealing
- dynamic programming
- solution quality
- job shop
- search algorithm