An efficient ILS heuristic for total flow time minimization in a Flow Shop Sequence Dependent Group Scheduling problem.
Harlem Mauricio Madrid VilladiegoJosé Elias Claudio ArroyoVinícius Vilar JacobAndré Gustavo dos SantosLuciana Brugiolo GonçalvesPublished in: HIS (2012)
Keyphrases
- scheduling problem
- flowshop
- tabu search
- asymptotic optimality
- multi start
- unrelated parallel machines
- strongly np hard
- metaheuristic
- job shop scheduling problem
- job processing times
- solution quality
- single machine
- setup times
- processing times
- np hard
- flowshop scheduling
- feasible solution
- simulated annealing
- completion times
- minimizing makespan
- sequence dependent setup times
- optimal solution
- maximum lateness
- special case
- total tardiness
- makespan minimization
- job shop
- flowshop scheduling problems
- parallel machines
- optimization problems
- precedence constraints
- permutation flowshop
- memetic algorithm
- objective function
- scheduling jobs
- open shop
- lagrangian relaxation
- integer programming
- release dates
- benchmark problems
- combinatorial optimization
- total flowtime
- search algorithm