Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints

This paper considers a deterministic scheduling problem where multiple jobs with s-precedence relations are processed on multiple identical parallel machines. The objective is to minimize the total completion time. The s-precedence relation between two jobs i and j represents the situation where job j is constrained from processing until job i starts processing, which is different from the standard definition of a precedence relation where j cannot start until i completes. The s-precedence relation has wide applicability in the real world such as first-come-first-served processing systems. The problem is shown to be intractable, for which a heuristic procedure is derived. Numerical experiments are conducted to show that the derived heuristic provides effective solutions.

[1]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

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

[3]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[4]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

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

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

[7]  W. A. Horn.  Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .

[8]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[9]  Chiun-Chieh Hsu,et al.  Task scheduling with precedence constraints to minimize the total completion time , 1995 .

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

[11]  Salah E. Elmaghraby,et al.  Sequencing precedence-related jobs on two machines to minimize the weighted completion time , 2006 .

[12]  Rajeev Motwani,et al.  Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine , 1999, Discret. Appl. Math..

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

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

[15]  Maurice Queyranne,et al.  Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, SIAM J. Comput..

[16]  Joseph Y.-T. Leung,et al.  Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time , 1991, Inf. Comput..

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

[18]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[19]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Eun-Seok Kim,et al.  Parallel machine scheduling with s-precedence constraints [conference item] , 2007 .

[21]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[22]  Moshe Dror,et al.  Scheduling Chains to Minimize Mean Flow Time , 1997, Inf. Process. Lett..

[23]  Eun-Seok Kim,et al.  Parallel machine scheduling with s-precedence constraints , 2010 .

[24]  Andreas S. Schulz.  Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds , 1996, IPCO.