Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis.
Angelo OddiRiccardo RasconiAmedeo CestaStephen F. SmithPublished in: Ann. Math. Artif. Intell. (2011)
Keyphrases
- job shop scheduling
- scheduling problem
- setup times
- job shop scheduling problem
- single machine
- flowshop
- np hard
- processing times
- precedence constraints
- parallel machines
- combinatorial optimization
- tabu search
- single machine scheduling problem
- multi item
- lot sizing
- combinatorial optimization problems
- branch and bound algorithm
- greedy algorithm
- optimization problems
- benchmark problems
- metaheuristic