A dynamic production planning and scheduling algorithm for two products processed on one line

Abstract This paper presents a dynamic production planning and scheduling algorithm for two products processed on one line over a fixed time horizon. Production rates are assumed fixed, and restrictions are placed or inventory levels and production run lengths. The resulting problem is a nonlinear binary program, which is solved using an implicit enumeration strategy. The algorithm focuses on the run changeover period while developing tighter bounds on the length of the upcoming run to improve computational efficiency. About 99% pf 297 randomly generated problems with varying demand patterns are solved in less than 15 seconds of CPU time on a CDC Cyber 172 Computer. A mixed integer programming formulation of the generalized multi-product case under no-backlogging of demand is also given.

[1]  Graham K. Rand,et al.  Decision Systems for Inventory Management and Production Planning , 1979 .

[2]  Edward P. C. Kao,et al.  A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs , 1979, Oper. Res..

[3]  S. Elmaghraby.  The Economic Lot Scheduling Problem (ELSP): Review and Extensions , 1978 .

[4]  Matthew J. Liberatore,et al.  Using MRP and EOQ/Safety Stock for Raw Materials Inventory Control: Discussion and Case Study , 1979 .

[5]  Marc Lambrecht,et al.  On the joint replenishment problem under deterministic time varying demand patterns , 1979 .

[6]  Daniel Granot,et al.  Generalized Covering Relaxation for 0-1 Programs. , 1978 .

[7]  Lawrence J. Watters.  Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems , 1967, Oper. Res..

[8]  Leonard Gilman,et al.  APL, an interactive approach , 1974 .

[9]  Thomas B. Crabill,et al.  A Two Product Dynamic Economic Lot Size Production Model with Either-Or Production Constraints. , 1974 .

[10]  Edward A Silver,et al.  Coordinated replenishments of items under time‐varying demand: Dynamic programming formulation , 1979 .

[11]  Leon S. Lasdon,et al.  The Status of Nonlinear Programming Software , 1979, Oper. Res..

[12]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..

[13]  Rolf A. Lundin,et al.  Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results , 1975, Oper. Res..

[14]  S. Graves.  Note---On the Deterministic Demand Multi-Product Single-Machine Lot Scheduling Problem , 1979 .

[15]  Suresh P. Sethi,et al.  Multiple Finite Production Rate Dynamic Lot Size Inventory Models , 1981, Oper. Res..

[16]  Daniel Granot,et al.  Technical Note - Generalized Covering Relaxation for 0-1 Programs , 1980, Oper. Res..