Order scheduling in dedicated and flexible machine environments

Order scheduling models are relatively new in the field of scheduling. Consider a facility with m parallel machines that can process k different products (job types). Each machine can process a given subset of different product types. There are n orders from n different clients. Each order requests specific quantities of the various different products that can be produced concurrently on their given subsets of machines; it may have a release date, a weight and a due date. Preemptions may be allowed. An order can not be shipped until the processing of all the products for the order has been completed. Thus, the finish time of an order is the time when the last job of the order has been completed. Even though the idea is somewhat new that order scheduling measures the overall completion time of a set of jobs (i.e., an order requesting different product types) instead of the individual completion time of each product type for any given order, many applications require that decision-makers consider orders rather than the individual product types in orders. Research into order scheduling models is motivated by their various real-life applications in manufacturing systems, equipment maintenance, computing systems, and other industrial contexts, where the components of each order can be processed concurrently on the parallel machines. In this research, two cases of order scheduling models are studied, namely, the fully dedicated environment in which each machine can produce one and only one product type, and the fully flexible machine environment in which each machine can produce all product types. With different side constraints and objective functions, the two cases include a lot of problems that are of interest. Special interest is focused on the minimization of the total weighted completion time, the number of late orders, the maximum lateness, and so on. On the one hand, polynomial time algorithms are proposed for some problems. One the other hand, for problems that are NP-hard, complexity proofs are shown and heuristics with their worst-case performance and empirical analyses are also presented.

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

[2]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[3]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[4]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

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

[6]  Chang Sup Sung,et al.  Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines , 1998 .

[7]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[8]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[9]  Shui Lam,et al.  A Level Algorithm for Preemptive Scheduling , 1977, J. ACM.

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

[11]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[12]  Maurice Queyranne,et al.  Structure of a simple scheduling polyhedron , 1993, Math. Program..

[13]  Izak Duenyas,et al.  Estimating the throughput of a cyclic assembly system , 1994 .

[14]  Edward G. Coffman,et al.  Optimal Preemptive Scheduling on Two-Processor Systems , 1969, IEEE Transactions on Computers.

[15]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[16]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

[17]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[18]  Vijay V. Vazirani,et al.  Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..

[19]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[20]  Arnaud Fréville,et al.  The multidimensional 0-1 knapsack problem: An overview , 2004, Eur. J. Oper. Res..

[21]  Sanjeev Khanna,et al.  Approximation Algorithms for Minimizing AverageWeighted Completion Time , 2004, Handbook of Scheduling.

[22]  T. C. Edwin Cheng,et al.  Customer order scheduling to minimize total weighted completion time , 2007 .

[23]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[24]  T. C. Edwin Cheng,et al.  Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem , 2002, Inf. Process. Lett..

[25]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[26]  Carsten Lund,et al.  Hardness of approximations , 1996 .

[27]  T. C. Edwin Cheng,et al.  Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs , 2003, J. Sched..

[28]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[29]  Gregory Dobson,et al.  Scheduling Independent Tasks on Uniform Processors , 1984, SIAM J. Comput..

[30]  Donald K. Friesen,et al.  Tighter Bounds for LPT Scheduling on Uniform Processors , 1987, SIAM J. Comput..

[31]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[32]  T. C. Edwin Cheng,et al.  A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs , 2003, J. Sched..

[33]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[34]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[35]  Jaehwan Yang.  Scheduling with batch objectives , 1998 .

[36]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[37]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

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

[39]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[40]  D. Hochbaum.  Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .

[41]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[42]  Fred Glover,et al.  An Overview of Tabu Search Approaches to Production Scheduling Problems , 1995 .

[43]  Chris N. Potts,et al.  Scheduling multi‐operation jobs on a single machine , 1999, Ann. Oper. Res..

[44]  Manuel Laguna.  Implementing and testing the tabu cycle and conditional probability methods , 2006, Comput. Oper. Res..

[45]  Jan Karel Lenstra,et al.  Sequencing by enumerative methods , 1977 .

[46]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

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

[48]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[49]  C. Zheng,et al.  ; 0 ; , 1951 .

[50]  Toshihide Ibaraki,et al.  A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..

[51]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

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

[53]  Chelliah Sriskandarajah,et al.  Open shops with jobs overlap - revisited , 2005, Eur. J. Oper. Res..

[54]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.