Similar Search Results

Turnpike Horizons for Production Planning

Sethi, Suresh P. - 2019

A quadratic model for production-inventory planning was made famous by Holt, Modigliani, Muth, and Simon in 1960 in [3], especially for its application to a paint factory. A discrete control version of a related quadratic production-inventory model was studied by Kleindorfer, Kriebel, Thompson,...

Persistent link: https://www.econbiz.de/10012746433

Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes

Pochet, Yves; Wolsey, Laurence A. - In: Management Science 37 (1991) 1, pp. 53-67

without incurring the costs of adapting an algorithm. …

Persistent link: https://www.econbiz.de/10009191327

A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem

Chand, Suresh; Morton, Thomas E. - In: Management Science 28 (1982) 6, pp. 652-669

periods of forecast data. We also present a forward dynamic programming algorithm which is computationally more efficient than … the forward algorithm of Blackburn and Eppen (Blackburn, J., G. Eppen. 1973. A two asset deterministic cash balance …

Persistent link: https://www.econbiz.de/10009191607

Production Lot Sizing with Machine Breakdowns

Groenevelt, Harry; Pintelon, Liliane; Seidmann, Abraham - In: Management Science 38 (1992) 1, pp. 104-123

Economic lot sizing and batching models often assume reliable manufacturing facilities. In this research, we focus on the effects of machine breakdowns and corrective maintenance on the economic lot sizing decisions. Two production control policies are proposed for coping with these stochastic...

Persistent link: https://www.econbiz.de/10009191808

The Dynamic Line Allocation Problem

Ahmadi, Reza H.; Dasu, Sriram; Tang, Christopher S. - In: Management Science 38 (1992) 9, pp. 1341-1353

Consider a plant that has information about the arrival schedule of its "inputs" over a planning cycle. The plant has parallel production lines for processing multiple types of products. However, changeover cost and changeover time are incurred when a line changes from processing one type of...

Persistent link: https://www.econbiz.de/10009191852

A Sequential Lot Sizing Heuristic with Optimal Average Performance

Axsäter, Sven - In: Management Science 34 (1988) 11, pp. 1324-1332

The classical dynamic lot size problem without backlogging is in practice usually solved with the aid of various heuristics. Most heuristics are sequential techniques, i.e. the future demand is considered period for period, and a decision whether to have a set-up or not in a certain period is...

Persistent link: https://www.econbiz.de/10009191913

Some Extensions of the Discrete Lotsizing and Scheduling Problem

Salomon, Marc; Kroon, Leo G.; Kuik, Roelof; Wassenhove, … - In: Management Science 37 (1991) 7, pp. 801-812

In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufacturing process. This...

Persistent link: https://www.econbiz.de/10009191917

Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs

Belvaux, Gaetan; Wolsey, Laurence A. - In: Management Science 47 (2001) 7, pp. 993-1007

In spite of the remarkable improvements in the quality of general purpose mixed-integer programming software, the effective solution of a variety of lot-sizing problems depends crucially on the development of tight formulations for the special problem features occurring in practice. After...

Persistent link: https://www.econbiz.de/10009191988

Common Cycle Lot-Size Scheduling for Multi-Product, Multi-Stage Production

El-Najdawi, Mohammad K.; Kleindorfer, Paul R. - In: Management Science 39 (1993) 7, pp. 872-885

In this paper we study the Common Cycle Scheduling Problem (CCSP). This classic production problem is concerned with determining optimal production lot sizes for a given set of products using a common facility. CCSP is based on scheduling all products using a common (base) cycle time, so that...

Persistent link: https://www.econbiz.de/10009197642

Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems

Roundy, Robin - In: Management Science 35 (1989) 12, pp. 1433-1442

In the capacitated version of the Divide and Conquer algorithm for lot sizing in multi-stage production …/inventory problems, feasibility is often lost when the reorder intervals are rounded off to powers of two. We propose a new algorithm for … that occurs when the intervals are rounded off using this algorithm cannot exceed 44%, and that for systems with a single …

Persistent link: https://www.econbiz.de/10009197755