Economic lot scheduling with resources in parallel

In this article we consider the economic lot scheduling problem with m machines (or facilities) in parallel. There are n different types of items. Item j has a demand D j per unit time, a holding cost h j per unit time, and a setup cost K j . The machines have different speeds. The speed of machine i is v i . Machine i can produce item j at rate v i P j . We consider three different models. The objective in all three models is to find an assignment of items to machines that minimises the total cost per unit time of the entire system. In the first model, each machine operates according to a rotation or cyclical schedule and the cycle lengths of the rotation schedules of the m machines have to be the same. In the second model, each machine again operates according to a rotation schedule, but the rotation schedules are allowed to have different cycle lengths. In the third model, the machines do not have to operate according to rotation schedules. For each model, we consider a number of special cases that provide some insights into the role each parameter plays. Based on the results of the special cases, we formulate for each model a heuristic that can be applied to arbitrary instances. In the concluding remarks, we discuss the significance of our results for problems that occur in practice.

[1]  David Pisinger.  An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..

[2]  Kavindra Malik,et al.  Lotsizing and Scheduling in Parallel Machines with Sequence-Dependent Setup Costs , 1999 .

[3]  Wolfgang Brüggemann,et al.  Ausgewählte Probleme der Produktionsplanung , 1995 .

[4]  Clarence Zener,et al.  Geometric Programming , 1974 .

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

[6]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[7]  Gregory Dobson.  The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups , 1992, Oper. Res..

[8]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

[9]  K. Haase.  Lotsizing and Scheduling for Production Planning , 1994 .

[10]  Paul H. Zipkin,et al.  Foundations of Inventory Management , 2000 .

[11]  L. V. Wassenhove,et al.  Some extensions of the discrete lotsizing and scheduling problem , 1991 .

[12]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[13]  Anders Segerstedt.  A note on ‘frequency approach for treating capacity constrained multi-level production’, ijpr, 42, 3119–3137 , 2004 .

[14]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[15]  José Juan Carreño.  Economic Lot Scheduling for Multiple Products on Parallel Identical Processors , 1990 .

[16]  Anders Segerstedt.  Frequency approach for treating capacity-constrained multilevel production , 2004 .

[17]  Gerhard J. Woeginger,et al.  Approximation schemes-a tutorial , 2001 .

[18]  Han Hoogeveen,et al.  Parallel Machine Scheduling by Column Generation , 1999, Oper. Res..

[19]  Anders Segerstedt,et al.  Economic lot scheduling problems incorporating a cost of using the production facility , 2009 .

[20]  Ramesh Bollapragada,et al.  Single-Stage Resource Allocation and Economic Lot Scheduling on Multiple, Nonidentical Production Lines , 1999 .

[21]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[22]  Robert R. Inman,et al.  Product grouping for batch processes , 1996 .

[23]  Florian Seeanner.  Multi-level lot-sizing and scheduling , 2013 .

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Karl Ernst Osthaus.  Van de Velde , 1920 .

[26]  Gregory Dobson,et al.  The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes , 1987, Oper. Res..

[27]  Warren B. Powell,et al.  Solving Parallel Machine Scheduling Problems by Column Generation , 1999, INFORMS J. Comput..

[28]  Subbarao Kambhampati,et al.  Planning and Scheduling , 1997, The Computer Science and Engineering Handbook.