Capacity planning and lead time management

In this paper we discuss a framework for capacity planning and lead time management in manufacturing companies, with an emphasis on the machine shop. First we show how queueing models can be used to find approximations of the mean and the variance of manufacturing shop lead times. These quantities often serve as a basis to set a fixed planned lead time in an MRP-controlled environment. A major drawback of a fixed planned lead time is the ignorance of the correlation between actual work loads and the lead times that can be realized under a limited capacity flexibility. To overcome this problem, we develop a method that determines the earliest possible completion time of any arriving job, without sacrificing the delivery performance of any other job in the shop. This earliest completion time is then taken to be the delivery date and thereby determines a workload-dependent planned lead time. We compare this capacity planning procedure with a fixed planned lead time approach (as in MRP), with a procedure in which lead times are estimated based on the amount of work in the shop, and with a workload-oriented release procedure. Numerical experiments so far show an excellent performance of the capacity planning procedure.

[1]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[2]  Eliyahu M. Goldratt,et al.  Computerized shop floor scheduling , 1988 .

[3]  J. Carlier.  The one-machine sequencing problem , 1982 .

[4]  G. J. Meester,et al.  Development of a shop floor control system for hybrid job shops , 1994 .

[5]  H.J.J. Kals,et al.  THE INTEGRATION OF PROCESS PLANNING AND MACHINE LOADING IN SMALL BATCH PART MANUFACTURING , 1993 .

[6]  Whm Henk Zijm,et al.  Single-machine scheduling with release dates, due dates and family setup times , 1994 .

[7]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[8]  J. Slomp,et al.  A manufacturing planning and control system for a flexible manufacturing system , 1993 .

[9]  Uday S. Karmarkar,et al.  Lot Sizes, Lead Times and In-Process Inventories , 1987 .

[10]  Jwm Will Bertrand,et al.  Production control and information systems for component-manufacturing shops , 1981 .

[11]  Johannes M.J. Schutten,et al.  Parallel machine scheduling with release dates, due dates and family setup times , 1996 .

[12]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[13]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[14]  H. Wiendahl.  Die belastungsorientierte Fertigungssteuerung , 1992 .

[15]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

[16]  Geatse Meester,et al.  Multi-resource scheduling of an FMC in discrete parts manufacturing , 1994 .

[17]  E. Balas,et al.  The one-machine problem with delayed precedence constraints and its use in job shop scheduling , 1995 .

[18]  U. Karmarkar,et al.  Lotsizing in Multi-Item Multi- Machine Job Shops , 1985 .