Parallel dedicated machines scheduling with chain precedence constraints

A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.

[1]  Y. Sotskov,et al.  The complexity of shop-scheduling problems with two or three jobs , 1991 .

[2]  S. Akers.  Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .

[4]  Alessandro Agnetis,et al.  A job-shop problem with one additional resource type , 2011, J. Sched..

[5]  Joyce Friedman,et al.  A Non-Numerical Approach to Production Scheduling Problems , 1955, Oper. Res..

[6]  Peter Brucker,et al.  An efficient algorithm for the job-shop problem with two jobs , 2005, Computing.

[7]  X. Shao,et al.  A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem , 2010 .

[8]  Arianna Alfieri,et al.  Minimum cost multi-product flow lines , 2007, Ann. Oper. Res..

[9]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[10]  Hans Kellerer,et al.  Scheduling problems for parallel dedicated machines under multiple resource constraints , 2003, Discret. Appl. Math..

[11]  Alessandro Agnetis,et al.  Scheduling three chains on two parallel machines , 2010, Eur. J. Oper. Res..

[12]  P. Bruckner,et al.  An efficient algorithm for the job-shop problem with two jobs , 1988 .

[13]  Hans Kellerer,et al.  Scheduling parallel dedicated machines under a single non-shared resource , 2003, European Journal of Operational Research.

[14]  Nathalie Sauer,et al.  Heuristics for unrelated machine scheduling with precedence constraints , 1997 .

[15]  George L. Nemhauser,et al.  A Geometric Model and a Graphical Algorithm for a Sequencing Problem , 1963 .

[16]  D. R. Fulkerson.  Note on Dilworth’s decomposition theorem for partially ordered sets , 1956 .

[17]  Natalia V. Shakhlevich,et al.  NP-hardness of Shop-scheduling Problems with Three Jobs , 1995, Discret. Appl. Math..

[18]  Peter Brucker,et al.  Complexity of shop-scheduling problems with fixed number of jobs: a survey , 2007, Math. Methods Oper. Res..

[19]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[20]  Aravind Srinivasan,et al.  Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints , 2005, APPROX-RANDOM.

[21]  Wlodzimierz Szwarc,et al.  SOLUTION OF THE AKERS-FRIEDMAN SCHEDULING PROBLEM , 1960 .

[22]  Alessandro Agnetis,et al.  Task assignment and subassembly scheduling in flexible assembly lines , 1995, IEEE Trans. Robotics Autom..

[23]  Jacek Blazewicz,et al.  Review of properties of different precedence graphs for scheduling problems , 2002, Eur. J. Oper. Res..