A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times.
Francisco Ángel-BelloAda M. AlvarezJoaquín A. PachecoIris Martínez-SalazarPublished in: Comput. Math. Appl. (2011)
Keyphrases
- sequence dependent setup times
- scheduling problem
- single machine
- parallel machine scheduling problem
- flowshop
- tabu search
- strongly np hard
- setup times
- precedence constraints
- parallel machines
- single machine scheduling problem
- total weighted tardiness
- job shop scheduling problem
- maximum lateness
- release dates
- processing times
- total tardiness
- np hard
- lagrangian relaxation
- lot sizing
- dynamic programming
- combinatorial optimization
- search algorithm
- branch and bound algorithm
- search procedure
- feasible solution
- solution quality
- job shop
- simulated annealing
- optimal solution
- resource consumption
- setup cost
- multi item
- production scheduling
- multistage
- metaheuristic
- linear programming
- lower bound