A heuristic approach to batching and scheduling a single machine to minimize setup costs.
Alessandro AgnetisArianna AlfieriGaia NicosiaPublished in: Comput. Ind. Eng. (2004)
Keyphrases
- setup times
- total tardiness
- scheduling problem
- sequence dependent setup times
- single machine
- scheduling jobs
- setup cost
- precedence constraints
- number of late jobs
- parallel machines
- release dates
- strongly np hard
- release times
- tabu search
- lot sizing
- processing times
- flowshop
- lagrangian relaxation
- lead time
- holding cost
- np hard
- production planning
- optimal solution
- dynamic programming
- branch and bound algorithm
- single machine scheduling problem
- scheduling algorithm
- mixed integer programming
- identical parallel machines
- batch processing
- production cost
- multi item
- preemptive scheduling
- global constraints
- asymptotically optimal
- total cost
- feasible solution
- search algorithm
- combinatorial optimization
- simulated annealing
- lower bound
- search procedure
- objective function
- supply chain
- production system
- knapsack problem
- integer programming
- column generation