Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms

An automotive parts manufacturer produces a wide variety of parts in a job shop environment. Many of the manufacturing operations have substantial setups. When a client phones in an order, the manufacturer must decide quickly whether or not it has the capacity required to accept the order. We develop a simplified formulation of the order acceptance problem. We formulate the discrete-time version as an integer program. The problem is NP-hard, but in 51 out of 51 test problems the LP relaxation is tight. For larger problems we test several heuristics. Three of the heuristics look promising: simulated annealing, a genetic algorithm, and a linear-programming-based heuristic.

[1]  James H. Bookbinder,et al.  Setting Job-Shop Due-Dates with Service-Level Constraints , 1985 .

[2]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[3]  Izak Duenyas,et al.  Single facility due date setting with multiple customer classes , 1995 .

[4]  S. T. Enns.  Finite capacity scheduling systems: performance issues and comparisons , 1996 .

[5]  Thomas E. Morton,et al.  Selecting jobs for a heavily loaded shop with lateness penalties , 1996, Comput. Oper. Res..

[6]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[7]  M. Spearman,et al.  Optimal Lead Time Policies , 1999 .

[8]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[9]  L. Gelders,et al.  Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory , 2015, Oper. Res..

[10]  Nico Vandaele,et al.  Clips: a capacity and lead time integrated procedure for scheduling , 1998 .

[11]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[12]  Ludo Gelders,et al.  Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II - Computation and Structure , 1975, Oper. Res..

[13]  W. Hopp,et al.  Quoting Customer Lead Times , 1995 .

[14]  Peter Brucker,et al.  Sequencing and scheduling , 2003, Eur. J. Oper. Res..

[15]  Can Akkan.  Overtime Scheduling: An Application in Finite-capacity Real-time Scheduling , 1996 .

[16]  Charles A. Holloway,et al.  Job Shop Scheduling with Due Dates and Overtime Capability , 1974 .

[17]  Stéphane Dauzère-Pérès,et al.  Lot Streaming in Job-Shop Scheduling , 1997, Oper. Res..

[18]  Whm Henk Zijm,et al.  Order acceptance strategies in a production-to-order environment with setup times and due-dates , 1992 .

[19]  R. Ravi,et al.  Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues , 2001, Manag. Sci..

[20]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[21]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[22]  Andrew G. Loerch.  A new approach to production planning, scheduling, and due-date quotation in manufacturing systems , 1990 .

[23]  Yeong-Dae Kim,et al.  Simulated annealing and genetic algorithms for scheduling products with multi-level product structure , 1996, Comput. Oper. Res..

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

[25]  Hanan Luss,et al.  A due date assignment algorithm for multiproduct manufacturing facilities , 1993 .

[26]  Silvanus T. Enns.  Lead time selection and the behaviour of work flow in job shops , 1998, Eur. J. Oper. Res..

[27]  J. A. Muckstadt,et al.  An approach to production planning and scheduling in cyclically scheduled manufacturing systems , 1994 .

[28]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .