Heuristic and metaheuristic approaches for parallel machine scheduling under resource constraints

AbstractIn this paper, an NP-hard parallel machine scheduling problem under resource reservation constraints is studied. The problem is characterized by a set of operations that have to be scheduled on parallel machines, given that the process of each operation requires one specific additional resource, present in a single copy, from a set of reusable resources. The objective is to minimize the makespan. After a mathematical formulation of the problem, two new heuristics that quickly reach a satisfying solution and a simulated annealing metaheuristic aiming to improve the solutions’ quality are provided. The performance of these methods is assessed in a detailed experimental study that includes a comparison with three heuristics from the literature and a worst case analysis of the best performing heuristic. The obtained results show that one of our heuristics outperforms the literature’s methods for nearly all the tested instances, while the simulated annealing algorithm improves the heuristics’ outcomes and ensure near optimal solutions in most of the tests.

[1]  Yang-Kuei Lin,et al.  Unrelated parallel machine scheduling with setup times and ready times , 2014 .

[2]  Johnny C. Ho,et al.  Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs , 2007, Eur. J. Oper. Res..

[3]  Wei-Chang Yeh,et al.  Uniform parallel machine scheduling with resource consumption constraint , 2015 .

[4]  Jose A. Ventura,et al.  Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints , 2003, Comput. Oper. Res..

[5]  Ceyda Oguz,et al.  Parallel machine scheduling with additional resources: Notation, classification, models and solution methods , 2013, Eur. J. Oper. Res..

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

[7]  Tom Fawcett,et al.  An introduction to ROC analysis , 2006, Pattern Recognit. Lett..

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

[9]  Jatinder N. D. Gupta,et al.  Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness , 2015, Eur. J. Oper. Res..

[10]  Alexander Grigoriev,et al.  Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times , 2005, IPCO.

[11]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[12]  Lingfa Lu,et al.  Parallel-machine scheduling with release dates and rejection , 2016, 4OR.

[13]  Joseph B. Mazzola,et al.  Scheduling Parallel Manufacturing Cells with Resource Flexibility , 1996 .

[14]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[15]  Antonio Costa,et al.  Scheduling of unrelated parallel manufacturing cells with limited human resources , 2008 .

[16]  Shanlin Yang,et al.  Author's Personal Copy Applied Soft Computing Parallel Machine Scheduling Problem to Minimize the Makespan with Resource Dependent Processing Times , 2022 .

[17]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

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

[19]  Wieslaw Kubiak,et al.  Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints , 1993, Discret. Appl. Math..

[20]  Frank Werner,et al.  Heuristic constructive algorithms for open shop scheduling to minimize mean flow time , 2008, Eur. J. Oper. Res..

[21]  Joseph Y.-T. Leung,et al.  Makespan minimization in online scheduling with machine eligibility , 2010, 4OR.

[22]  Mostafa Zandieh,et al.  A contribution and new heuristics for open shop scheduling , 2010, Comput. Oper. Res..

[23]  Antonio Costa,et al.  Makespan Minimization of Unrelated Parallel Machines with Limited Human Resources , 2013 .

[24]  Erwin Pesch,et al.  Solving the open shop scheduling problem , 2001 .

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

[26]  Wieslaw Kubiak,et al.  Minimizing mean flow-time with parallel processors and resource constraints , 1987, Acta Informatica.

[27]  Carlos F. Daganzo,et al.  A branch and bound solution method for the crane scheduling problem , 1990 .

[28]  John W. Fowler,et al.  A SURVEY OF ALGORITHMS FOR SINGLE AND MULTI-OBJECTIVE UNRELATED PARALLEL-MACHINE DETERMINISTIC SCHEDULING PROBLEMS , 2004 .

[29]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[30]  Frank Werner,et al.  Parallel machine problems with equal processing times: a survey , 2011, J. Sched..

[31]  Jinwen Ou,et al.  Improved approximation algorithms for parallel machine scheduling with release dates and job rejection , 2017, 4OR.