Scheduling Tasks with Comb Precedence Constraints on Dedicated Machines

Abstract A set of n nonpreemptive tasks are to be scheduled on m dedicated machines in order to minimize the overall makespan. Precedence constraints among the tasks, deterministic processing times and processing machine of each task are given. We present lower bounds of the minimum makespan and heuristic algorithms for two relevant cases in manufacturing applications, namely when the precedence constraints form a comb or a caterpillar. Promising preliminary computational tests are also reported proving the efficiency and effectiveness of the proposed solution algorithm.

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

[2]  Hans Kellerer,et al.  Parallel dedicated machines scheduling with chain precedence constraints , 2012, Eur. J. Oper. Res..

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

[4]  Aravind Srinivasan,et al.  Scheduling on Unrelated Machines under Tree-Like Precedence Constraints , 2005, Algorithmica.

[5]  N. V. Shakhlevich,et al.  NP-hardness of shop-scheduling problems with three jobs , 1995 .

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

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

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

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

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

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

[12]  Young Hae Lee,et al.  Integrated machine tool selection and operation sequencing with capacity and precedence constraints using genetic algorithm , 2002 .

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

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

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

[16]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[17]  Andrea Pacifici,et al.  Minimizing Part Transfer Costs in Flexible Manufacturing Systems: A Computational Study on Different Lower Bounds , 2013, 2013 UKSim 15th International Conference on Computer Modelling and Simulation.