A cost saving technique for solving capacitated multi-stage lot-sizing problems
HN Chiu - Computers & industrial engineering, 1993 - Elsevier
The scheduling of lot sizes in capacitated MRP-type manufacturing systems is a routine
decision-making process. However, the interdependence between stages and the capacity …
decision-making process. However, the interdependence between stages and the capacity …
A Lagrangian heuristic for capacitated single item lot sizing problems
N Brahimi, S Dauzère-Pérès - 4OR, 2015 - Springer
This paper presents a new Lagrangian heuristic to solve the general capacitated single item
lot sizing problem (CSILSP) where the total costs of production, setup, and inventory are to …
lot sizing problem (CSILSP) where the total costs of production, setup, and inventory are to …
An incremental cost and resource smoothing heuristic for the capacitated lot sizing problem
N Singh, D Rajamani - Computers & industrial engineering, 1991 - Elsevier
A heuristic lot sizing algorithm is proposed for the multi-item, multi-period problem with
limited resources. The objective is to minimize the total cost consisting of set-up and …
limited resources. The objective is to minimize the total cost consisting of set-up and …
A note on “the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
Gupta and Magnusson [The capacitated lot-sizing and scheduling problem with sequence-
dependent setup costs and setup times. Computers and Operations Research 2005; 32 (4) …
dependent setup costs and setup times. Computers and Operations Research 2005; 32 (4) …
Capacitated lot-sizing and scheduling by lagrangean relaxation
Abstract Development of new models and solution procedures for production planning has
been of research interest for several decades. Implementation of these models has resulted …
been of research interest for several decades. Implementation of these models has resulted …
MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups
M Mohammadi, SMT Fatemi Ghomi… - … Journal of Production …, 2010 - Taylor & Francis
Lotsizing in capacitated pure flow shop with sequence-dependent setups has been
considered in this paper. An exact formulation of the problem is provided as a mixed-integer …
considered in this paper. An exact formulation of the problem is provided as a mixed-integer …
A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
M Gopalakrishnan, K Ding, JM Bourjolly… - Management …, 2001 - pubsonline.informs.org
This paper presents a tabu-search heuristic for the capacitated lot-sizing problem (CLSP)
with set-up carryover. This production-planning problems allows multiple items to be …
with set-up carryover. This production-planning problems allows multiple items to be …
A new algorithm for determining production schedules when solving the multi-product economic lot sizing problem in flow shops
JY Huang, MJ Yao - The International Journal of Advanced Manufacturing …, 2007 - Springer
In this paper, we study the generation of production schedules in the multi-product economic
lot sizing problem in flow shops (ie, the FS-ELSP) under the power-of-two policy. To …
lot sizing problem in flow shops (ie, the FS-ELSP) under the power-of-two policy. To …
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
In this paper, we solve the capacitated multi item lot-sizing problem with non-customer
specific production time windows and setup times using two approaches:(i) using a …
specific production time windows and setup times using two approaches:(i) using a …
Numerical evaluation of heuristics for the multi-item single-level capacitated lot-size problem
HO Günther - Engineering costs and production economics, 1988 - Elsevier
The problem considered is the determination of lot sizes for multiple products to be
produced on a single production facility with limited capacity. An optimal solution to this lot …
produced on a single production facility with limited capacity. An optimal solution to this lot …