A dynamic production planning and scheduling algorithm for two products processed on one line |
| |
Authors: | Matthew J. Liberatore |
| |
Affiliation: | College of Commerce & Finance, Villanova University, Villanova, PA 19085, U.S.A. |
| |
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. |
| |
Keywords: | Production planning scheduling manufacturing industries integer programming |
本文献已被 ScienceDirect 等数据库收录! |
|