Case Article - DeLand Crayon Company: An Application of the Traveling Salesman Problem to Production Scheduling with Sequence-Dependent Setup Times.
B. Madhu RaoPetros XanthopoulosQipeng Phil ZhengPublished in: INFORMS Trans. Educ. (2020)
Keyphrases
- traveling salesman problem
- production scheduling
- single machine
- sequence dependent setup times
- scheduling problem
- combinatorial optimization
- ant colony optimization
- job shop scheduling problem
- single machine scheduling problem
- processing times
- vehicle routing
- vehicle routing problem
- combinatorial optimization problems
- optimization problems
- process planning
- valid inequalities
- job shop scheduling
- job shop
- lot sizing
- flowshop
- routing problem
- crossover operator
- manufacturing systems
- multistage
- parallel machines
- simulated annealing
- multi objective