The complexity of customer order scheduling problems on parallel machines

This paper considers scheduling problems where a set of jobs (customer order) is shipped at the same time. The objective function is associated with the completion time of the orders. While a machine can process only one job at a time, multiple machines can process simultaneously jobs in an order. We first introduce this relatively new class of the customer order scheduling problems on parallel machines. Then, we establish the complexity of several problems with different types of objectives, job restrictions, and machine environments. For some tractable cases, we propose optimal solution procedures.

[1]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

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

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

[4]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[5]  Jatinder N. D. Gupta,et al.  Single machine hierarchical scheduling with customer orders and multiple job classes , 1997, Ann. Oper. Res..

[6]  Kenneth R. Baker,et al.  Scheduling the production of components at a common facility , 1988 .

[7]  Marc E. Posner,et al.  Scheduling Parallel Machines for the Customer Order Problem , 2003, J. Sched..

[8]  James D. Blocher,et al.  Customer order scheduling in a general job shop environment , 1998 .

[9]  Carlos F. Daganzo,et al.  THE CRANE SCHEDULING PROBLEM , 1989 .

[10]  Chris N. Potts,et al.  Scheduling the production of two-component jobs on a single machine , 2000, Eur. J. Oper. Res..

[11]  Carsten Jordan.  Batching and Scheduling: Models and Methods for Several Problem Classes , 1996 .

[12]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[13]  Mihalis Yannakakis,et al.  Optimal Scheduling of Products with Two Subassemblies on a Single Machine , 1989, Oper. Res..

[14]  Carlos F. Daganzo,et al.  A branch and bound solution method for the crane scheduling problem , 1990 .

[15]  James D. Blocher,et al.  The customer order lead‐time problem on parallel machines , 1996 .

[16]  Michael J. Magazine,et al.  Batching in single operation manufacturing systems , 1985 .

[17]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..