Heuristic decomposition and LP-based scheduling in make-and-pack production.
Philipp BaumannNorbert TrautmannPublished in: IEEM (2011)
Keyphrases
- packing problem
- list scheduling
- bin packing
- scheduling problem
- production scheduling
- optimal solution
- shop floor
- production planning
- iterative repair
- job shop scheduling problem
- tabu search
- scheduling algorithm
- linear programming
- rolling horizon
- feasible solution
- unrelated parallel machines
- scheduling jobs
- scheduling policies
- simulated annealing
- search algorithm
- linear program
- preventive maintenance
- batch processing
- parallel machines
- round robin
- decomposition method
- objective function
- scheduling decisions
- processing times
- resource allocation
- combinatorial optimization
- mixed integer programming model
- single machine
- integer programming
- dynamic programming
- response time
- lot size
- optimization problems
- resource constraints
- lagrangian relaxation
- np hard
- flowshop
- supply chain
- lp relaxation
- constraint satisfaction
- linear programming relaxation