Parallel machine, capacitated lot-sizing and scheduling for the pipe-insulation industry
01 Feb 2020-International Journal of Production Research (Taylor & Francis)-Vol. 58, Iss: 3, pp 800-817
TL;DR: A solution procedure for a production problem that involves the optimal lot-sizing and scheduling of multiple products on parallel machines over a long planning horizon is developed, in the context of the manufacturing of pipe insulation.
Abstract: We develop a solution procedure for a production problem that involves the optimal lot-sizing and scheduling of multiple products on parallel machines over a long planning horizon. The objective is...
Citations
More filters
Posted Content•
01 Jan 1994TL;DR: This paper considers a single-stage system where a number of different items have to be manufactured on one machine and presents a heuristic which applies a priority rule and shows that the heuristic is more efficient to solve the CLSD.
Abstract: A new model is presented for capacitated lot-sizing with sequence dependent setup costs. The model is solved heuristically with a backward oriented method; the sequence and lot-size decisions are based on a priority rule which consists of a convex combination of setup and holding costs. A computational study is performed where the heuristic is compared with the Fleischmann approach for the discrete lot-sizing and scheduling problem with sequence dependent setup costs.
125 citations
Posted Content•
TL;DR: A new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs is presented.
Abstract: This paper presents a new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last product produced in a period are determined by the model. We solve a model which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs. Our algorithm solves a series of mixed-integer linear programs in an iterative so-called Fix-and-Optimize approach. In each instance of these mixed-integer linear programs a large number of binary setup variables is fixed whereas only a small subset of these variables is optimized, together with the complete set of the inventory and lot size variables. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.
22 citations
TL;DR: The aim in this study is to develop an exact solution approach based on constraint programming (CP), which shows good performance in solving scheduling problems and proposes a CP model and enrich this model by adding lower bound restrictions and redundant constraints.
Abstract: This paper studies the multi-resource-constrained unrelated parallel machine scheduling problem under various operational constraints with the objective of minimising maximum completion time among ...
21 citations
Posted Content•
TL;DR: A new time-oriented decomposition heuristic is proposed to solve the dynamic multi-item multilevel lot-sizing problem in general product structures with single and multiple constrained resources as well as setup times.
Abstract: In this paper a new time-oriented decomposition heuristic is proposed to solve the dynamic multi-item multilevel lot-sizing problem in general product structures with single and multiple constrained resources as well as setup times. While lot-sizing decisions are made sequentially within an internally rolling planning interval (or lot-sizing window), capacities are always considered over the entire planning horizon. For each submodel a model formulation based on the "Simple Plant Location" representation is developed. These mixed-integer linear submodels are solved by standard mathematical programming software even for relatively large test instances. Extensive computational tests show that the heuristic proposed provides a better solution quality than a well-known special purpose heuristic.
16 citations
TL;DR: The numerical results showed that the VaNSAS outperformed all other proposed methods, since it could often find new optimal solutions during the simulation, while the local search based heuristics were often trapped at some local optima and the DE lacked search intensification.
Abstract: This paper focuses on a computational tool for scheduling sugarcane vehicles for dump tippler machines operating at a sugar mill. This problem was defined as scheduling M parallel capacitated machi...
16 citations
Cites background from "Parallel machine, capacitated lot-s..."
...…unrelated machines) (see Dolgui et al. 2009; Dolgui et al. 2010; Moonsri, Sethanan, and Sangsawang 2015; Zheng et al. 2019; Zhang et al. 2019; de Armas and Laguna 2020) machine restriction (see Hu, Bao, and Jin 2010; Zhang, Yao, and Li 2019), machine dependent setup time (see Nait Tahar et al.…...
[...]
References
More filters
TL;DR: Disjoint planning horizons are shown to be possible which eliminate the necessity of having data for the full N periods and desire a minimum total cost inventory management scheme which satisfies known demand in every period.
Abstract: (This article originally appeared in Management Science, October 1958, Volume 5, Number 1, pp. 89-96, published by The Institute of Management Sciences.)
A forward algorithm for a solution to the following dynamic version of the economic lot size model is given: allowing the possibility of demands for a single item, inventory holding charges, and setup costs to vary over N periods, we desire a minimum total cost inventory management scheme which satisfies known demand in every period. Disjoint planning horizons are shown to be possible which eliminate the necessity of having data for the full N periods.
2,114 citations
01 Jan 2016
TL;DR: In this paper, a forward algorithm for a solution to the following dynamic version of the economic lot size model is given: allowing the possibility of demands for a single item,,inventory holding charges, anid setup costs to vary over N periods, we desire a minimum total cost inventory management scheme which satisfies known demand in every period.
Abstract: A forward algorithm for a solution to the following dynamic version of the economic lot size model is given: allowing the possibility of demands for a single item,,inventory holding charges, anid setup costs to vary over N periods, we desire a minimum total cost inventory management scheme which satisfies known demand in every period. Disjoint planning horizons are shown to be possible which eliminate the necessity of having data for the full N periods.
1,520 citations
TL;DR: A review of the existing literature on quantitatively-oriented approaches for determining lot sizes when production or procurement yields are random identifies a variety of shortcomings of the literature in addressing problems encountered in practice, and suggests directions for future research.
Abstract: This paper reviews the literature on quantitatively-oriented approaches for determining lot sizes when production or procurement yields are random. We discuss issues related to the modeling of costs, yield uncertainty, and performance in the context of systems with random yields. We provide a review of the existing literature, concentrating on descriptions of the types of problems that have been solved and important structural results. We identify a variety of shortcomings of the literature in addressing problems encountered in practice, and suggest directions for future research.
946 citations
"Parallel machine, capacitated lot-s..." refers background in this paper
...Detailed information on approaches dealing with stochastic production rates can be found in reviews by Yano and Lee (1995) and Aloulou, Dolgui, and Kovalyov (2014)....
[...]
TL;DR: In this article, the authors consider single-level lot sizing problems, their variants and solution approaches, together with exact and heuristic approaches for their solution, and conclude with some suggestions for future research.
Abstract: Lot sizing is one of the most important and also one of the most difficult problems in production planning. This subject has been studied extensively in the literature. In this article, we consider single-level lot sizing problems, their variants and solution approaches. After introducing factors affecting formulation and the complexity of production planning problems, and introducing different variants of lot sizing and scheduling problems, we discuss single-level lot sizing problems, together with exact and heuristic approaches for their solution. We conclude with some suggestions for future research.
670 citations
"Parallel machine, capacitated lot-s..." refers background in this paper
...Karimi, Ghomi, and Wilson (2003) reviewed models and algorithms for CLSP....
[...]
TL;DR: A useful taxonomy is imposed on production scheduling problems and alternative formulations for a wide variety of problems within the taxonomy are developed and the linear programming relaxation of the new models is very effective in generating bounds.
Abstract: Mixed-integer programming models are typically not used to solve realistic-sized production scheduling problems because they require exorbitant solution times. We impose a useful taxonomy on production scheduling problems and develop alternative formulations for a wide variety of problems within the taxonomy. The linear programming relaxation of the new models is very effective in generating bounds. We show that these bounds are equal to those that could be generated using Lagrangian relaxation or column generation. The linear programming bounds increase in effectiveness as the problems become larger. Perhaps of greatest significance is that practitioners can obtain our results using only standard “off-the-shelf” codes such as LINDO or MPSX/370. We report computational experience in several computing environments (hardware and software) on problems with up to 200 products and 10 time periods (2000 0-1 variables).
412 citations
"Parallel machine, capacitated lot-s..." refers background in this paper
...CLSP is considered to be a large-bucket problem (Eppen and Martin 1987), because it allows for the possibility of several products being produced in the same time period....
[...]