Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics.
Vahid RoshanaeiM. M. Seyyed EsfehaniMostafa ZandiehPublished in: Expert Syst. Appl. (2010)
Keyphrases
- sequence dependent setup times
- scheduling problem
- single machine
- tabu search
- release dates
- flowshop
- parallel machines
- precedence constraints
- setup times
- total weighted tardiness
- processing times
- maximum lateness
- single machine scheduling problem
- weighted tardiness
- minimize total
- np hard
- metaheuristic
- job shop scheduling problem
- competitive ratio
- variable neighborhood search
- optimization problems
- dynamic programming
- optimal solution
- combinatorial optimization
- lot sizing
- scheduling algorithm
- feasible solution
- job shop
- search space
- lower bound
- approximation algorithms