793 research outputs found

    A computational analysis of lower bounds for big bucket production planning problems

    Get PDF
    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

    An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging

    Get PDF
    This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions

    A heuristic approach for big bucket multi-level production planning problems

    Get PDF
    Multi-level production planning problems in which multiple items compete for the same resources frequently occur in practice, yet remain daunting in their difficulty to solve. In this paper, we propose a heuristic framework that can generate high quality feasible solutions quickly for various kinds of lot-sizing problems. In addition, unlike many other heuristics, it generates high quality lower bounds using strong formulations, and its simple scheme allows it to be easily implemented in the Xpress-Mosel modeling language. Extensive computational results from widely used test sets that include a variety of problems demonstrate the efficiency of the heuristic, particularly for challenging problems

    Improved Lower Bounds For The Capacitated Lot Sizing Problem With Set Up Times

    Get PDF
    We present new lower bounds for the Capacitated Lot Sizing Problem with Set Up Times. We improve the lower bound obtained by the textbook Dantzig-Wolfe decomposition where the capacity constraints are the linking constraints. In our approach, Dantzig-Wolfe decomposition is applied to the network reformulation of the problem. The demand constraints are the linking constraints and the problem decomposes into subproblems per period containing the capacity and set up constraints. We propose a customized branch-and-bound algorithm for solving the subproblem based on its similarities with the Linear Multiple Choice Knapsack Problem. Further we present a Lagrange Relaxation algorithm for finding this lower bound. To the best of our knowledge, this is the first time that computational results are presented for this decomposition and a comparison of our lower bound to other lower bounds proposed in the literature indicates its high quality.Lagrange relaxation;Dantzig-Wolfe decomposition;capacitated lot sizing;lower bounds

    On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times

    Get PDF
    We address the multi-item, capacitated lot-sizing problem (CLSP) encountered in environments where demand is dynamic and to be met on time. Items compete for a limited capacity resource, which requires a setup for each lot of items to be produced causing unproductive time but no direct costs. The problem belongs to a class of problems that are difcult to solve. Even the feasibility problem becomes combinatorial when setup times are considered. This difculty in reaching optimality and the practical relevance of CLSP make it important to design and analyse heuristics to nd good solutions that can be implemented in practice. We consider certain mixed integer programming formulations of the problem and develop heuristics including a curtailed branch and bound, for rounding the setup variables in the LP solution of the tighter formulations. We report our computational results for a class of instances taken from literature

    On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times

    Get PDF
    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

    Meta-Heuristics for Dynamic Lot Sizing: a review and comparison of solution approaches

    Get PDF
    Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic algorithms and simulated annealing, have become popular and efficient tools for solving hard combinational optimization problems. We review the various meta-heuristics that have been specifically developed to solve lot sizing problems, discussing their main components such as representation, evaluation neighborhood definition and genetic operators. Further, we briefly review other solution approaches, such as dynamic programming, cutting planes, Dantzig-Wolfe decomposition, Lagrange relaxation and dedicated heuristics. This allows us to compare these techniques. Understanding their respective advantages and disadvantages gives insight into how we can integrate elements from several solution approaches into more powerful hybrid algorithms. Finally, we discuss general guidelines for computational experiments and illustrate these with several examples

    The linear dynamic lot size problem with minimum order quantities

    Get PDF
    This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the cumulative demand structure allowed us to develop a solution algorithm based on the concept of minimal sub-problems. We present an optimal solution to a minimal sub-problem in an explicit form and prove that it serves as a construction block for the optimal solution of the initial problem. The computational tests and the comparison with the published algorithm confirm the efficiency of the solution algorithm developed here. --lot sizing problem,minimum order quantity,dynamic programming

    Improved Lower Bounds For The Capacitated Lot Sizing Problem With Set Up Times

    Get PDF
    We present new lower bounds for the Capacitated Lot Sizing Problem with Set Up Times. We improve the lower bound obtained by the textbook Dantzig-Wolfe decomposition where the capacity constraints are the linking constraints. In our approach, Dantzig-Wolfe decomposition is applied to the network reformulation of the problem. The demand constraints are the linking constraints and the problem decomposes into subproblems per period containing the capacity and set up constraints. We propose a customized branch-and-bound algorithm for solving the subproblem based on its similarities with the Linear Multiple Choice Knapsack Problem. Further we present a Lagrange Relaxation algorithm for finding this lower bound. To the best of our knowledge, this is the first time that computational results are presented for this decomposition and a comparison of our lower bound to other lower bounds proposed in the literature indicates its high quality
    corecore