170 research outputs found
On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
Several mixed integer programming formulations have been proposed for modeling capacitated multi-level lot sizing problems with setup times. These formulations include the so-called facility location formulation, the shortest route formulation, and the inventory and lot sizing formulation with (l,S) inequalities. In this paper, we demonstrate the equivalence of these formulations when the integrality requirement is relaxed for any subset of binary setup decision variables. This equivalence has significant implications for decomposition-based methods since same optimal solution values are obtained no matter which formulation is used. In particular, we discuss the relax-and-fix method, a decomposition-based heuristic used for the efficient solution of hard lot sizing problems. Computational tests allow us to compare the effectiveness of different formulations using benchmark problems. The choice of formulation directly affects the required computational effort, and our results therefore provide guidelines on choosing an effective formulation during the development of heuristic-based solution procedures
A computational analysis of lower bounds for big bucket production planning problems
In this paper, we analyze a variety of approaches to obtain lower bounds for multi-level production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish relationships between some of these methods that, to our knowledge, have not been presented before. As will be highlighted, understanding the substructures of difficult problems provide crucial insights on why these problems are hard to solve, and this is addressed by a thorough analysis in the paper. We conclude with computational results on a variety of widely used test sets, and a discussion of future research
Mixed integer programming in production planning with backlogging and setup carryover : modeling and algorithms
This paper proposes a mixed integer programming formulation for modeling the capacitated multi-level lot sizing problem with both backlogging and setup carryover. Based on the model formulation, a progressive time-oriented decomposition heuristic framework is then proposed, where improvement and construction heuristics are effectively combined, therefore efficiently avoiding the weaknesses associated with the one-time decisions made by other classical time-oriented decomposition algorithms. Computational results show that the proposed optimization framework provides competitive solutions within a reasonable time
A novel flexible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in different machine configurations
© 2017, Springer Science+Business Media New York. This paper develops and tests an efficient mixed integer programming model for capacitated lot sizing and scheduling with non-triangular and sequence-dependent setup times and costs incorporating all necessary features of setup carryover and overlapping on different machine configurations. The model’s formulation is based on the asymmetric travelling salesman problem and allows multiple lots of a product within a period. The model conserves the setup state when no product is being processed over successive periods, allows starting a setup in a period and ending it in the next period, permits ending a setup in a period and starting production in the next period(s), and enforces a minimum lot size over multiple periods. This new comprehensive model thus relaxes all limitations of physical separation between the periods. The model is first developed for a single machine and then extended to other machine configurations, including parallel machines and flexible flow lines. Computational tests demonstrate the flexibility and comprehensiveness of the proposed models
A branch-and-cut algorithm for a multi-item inventory distribution problem
This paper considers a multi-item inventory distribution problem motivated
by a practical case occurring in the logistic operations of an hospital. There, a
single warehouse supplies several nursing wards. The goal is to define a weekly distribution
plan of medical products that minimizes the visits to wards, while respecting
inventory capacities and safety stock levels. A mathematical formulation is introduced
and several improvements such as tightening constraints, valid inequalities and an extended
reformulation are discussed. In order to deal with real size instances, an hybrid
heuristic based on mathematical models is introduced and the improvements are discussed.
A branch-and-cut algorithm using all the discussed improvements is proposed.
Finally, a computational experimentation is reported to show the relevance of the model
improvements and the quality of the heuristic scheme
- …