Valid inequalities for mixed 0-1 programs
Discrete Applied Mathematics
Solving mixed integer programming problems using automatic reformulation
Operations Research
Integer and combinatorial optimization
Integer and combinatorial optimization
Decomposition for scheduling flexible manufacturing systems
Operations Research
| Hi-index | 0.00 |
This paper investigates properties of integer programming modelsfor a class of production planning problems. The models are developed withina decision support system to advise a sales team of the products on which tofocus their efforts in gaining new orders in the short term. The productsgenerally require processing on several manufacturing cells and involveprecedence relationships. The cells are already (partially) committed withproducts for stock and to satisfy existing orders and therefore only theresidual capacities of each cell in each time period of the planning horizonare considered. The determination of production recommendations to the salesteam that make use of residual capacities is a nontrivial optimizationproblem. Solving such models is computationally demanding and techniques forspeeding up solution times are highly desirable. An integer programming modelis developed and various preprocessing techniques are investigated andevaluated. In addition, a number of cutting plane approaches have beenapplied. The performance of these approaches which are both general andapplication specific is examined.