Scheduling of uniform parallel machines with s-precedence constraints

This paper considers a problem of scheduling s-precedence constrained jobs on machines in parallel which have different speeds. The objective is to minimize the weighted 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. An LP-based heuristic procedure is derived for the problem. Numerical experiments are conducted to show that the derived heuristic finds effective solutions.

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

[2]  Eun-Seok Kim,et al.  Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints , 2009, Comput. Oper. Res..

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

[4]  Fabián A. Chudak,et al.  Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.

[5]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

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

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

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

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

[10]  Gerhard J. Woeginger.  A comment on scheduling on uniform machines under chain-type precedence constraints , 2000, Oper. Res. Lett..

[11]  Klaus Jansen,et al.  Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints , 2003, PPAM.

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

[13]  Wieslaw Kubiak,et al.  Scheduling chains on uniform processors with communication delays , 2002 .

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

[15]  Michael A. Bender,et al.  An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 2001, J. Algorithms.