Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times

Abstract Parallel machine scheduling problems have many practical and industrial applications. In this paper we study a generalization which is the unrelated parallel machine scheduling problem with machine and job sequence setup times (UPMS) with makespan minimization criterion. We propose new mixed integer linear programs and a mathematical programming based algorithm. These new models and algorithms are tested and compared with the existing ones in an extensive and comprehensive computational campaign. The performance of two popular commercial solvers (CPLEX and Gurobi) is also compared in the experiments. Results show that the proposed methods significantly improve on existing methods and are able to obtain solutions for extremely large instances of up to 1000 jobs and eight machines with relative deviations from lower bounds below 0.8%.

[1]  Shengyao Wang,et al.  A hybrid estimation of distribution algorithm for unrelated parallel machine scheduling with sequence-dependent setup times , 2016, IEEE/CAA Journal of Automatica Sinica.

[2]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[3]  H. C. Ozmutlu,et al.  Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times , 2014 .

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

[5]  Rubén Ruiz,et al.  A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times , 2011, Eur. J. Oper. Res..

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

[7]  Ghaith Rabadi,et al.  A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times , 2010, J. Intell. Manuf..

[8]  Ghaith Rabadi,et al.  Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times , 2006, J. Intell. Manuf..

[9]  Yunqiang Yin,et al.  Just-in-time scheduling with two competing agents on unrelated parallel machines ☆ , 2016 .

[10]  Gilbert Laporte,et al.  Thirty years of heterogeneous vehicle routing , 2016, Eur. J. Oper. Res..

[11]  J. Christopher Beck,et al.  Decomposition Methods for the Parallel Machine Scheduling Problem with Setups , 2016, INFORMS J. Comput..

[12]  Rubén Ruiz,et al.  Iterated greedy local search methods for unrelated parallel machine scheduling , 2010, Eur. J. Oper. Res..

[13]  Michael Pinedo,et al.  Planning and Scheduling in Manufacturing and Services , 2008 .

[14]  Chris N. Potts,et al.  Unrelated parallel machine scheduling using local search , 1994 .

[15]  Nagraj Balakrishnan,et al.  Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..

[16]  Sérgio Ricardo de Souza,et al.  An immune-inspired algorithm for an unrelated parallel machines' scheduling problem with sequence and machine dependent setup-times for makespan minimisation , 2015, Neurocomputing.

[17]  Tolga Bektas,et al.  Integer linear programming formulations of multiple salesman problems and its variations , 2006, Eur. J. Oper. Res..

[18]  Kaarthik Sundar,et al.  Algorithms for Heterogeneous, Multiple Depot, Multiple Unmanned Vehicle Path Planning Problems , 2017, J. Intell. Robotic Syst..

[19]  Shih-Wei Lin,et al.  Makespan minimization for scheduling unrelated parallel machines with setup times , 2010, Journal of Intelligent Manufacturing.

[20]  K. Sundar,et al.  An exact algorithm for a heterogeneous, multiple depot, multiple traveling salesman problem , 2015, 2015 International Conference on Unmanned Aircraft Systems (ICUAS).

[21]  Rubén Ruiz,et al.  Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources , 2017, Eur. J. Oper. Res..

[22]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[23]  Ghaith Rabadi,et al.  A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines—part II: enhancements and experimentations , 2014, J. Intell. Manuf..

[24]  Rubén Ruiz,et al.  Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization , 2012 .

[25]  T.C.E. Cheng,et al.  Parallel-machine scheduling of deteriorating jobs with potential machine disruptions ☆ , 2017 .

[26]  Ali Allahverdi,et al.  The third comprehensive survey on scheduling problems with setup times/costs , 2015, Eur. J. Oper. Res..

[27]  A. Guinet,et al.  Textile Production Systems: a Succession of Non-identical Parallel Processor Shops , 1991 .

[28]  Ghaith Rabadi,et al.  A Tabu Search Algorithm to Minimize the Makespan for the Unrelated Parallel Machines Scheduling Problem with Setup Times , 2006 .

[29]  Oliver Avalos-Rosales,et al.  Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times , 2015 .

[30]  Rubén Ruiz,et al.  Size-reduction heuristics for the unrelated parallel machines scheduling problem , 2011, Comput. Oper. Res..