ANALYSIS OF MIXED INTEGER PROGRAMMING FORMULATIONS FOR SINGLE MACHINE SCHEDULING PROBLEMS WITH SEQUENCE DEPENDENT SETUP TIMES AND RELEASE DATES

In this article, six different mixed integer programming (MIP) formulations are proposed and analyzed. These formulations are based on the knowledge of four different paradigms for single machine scheduling problems (SMSP) with sequence dependent setup times and release dates. Each formulation reflects a specific concept on how the variables and parameters are defined, requiring particular settings and definitions. A thorough historical overview of a variety of formulations for this family of problems is provided. All MIP formulations studied are implemented and tested, considering, as objective functions, the weighted completion time and the total weighted tardiness. For the Sousa and Wolsey based formulation, a set of constraints to improve its lower bound value is adapted and evaluated. Extensive computational experiments are performed considering a variety of instances to capture several aspects of practical situations. Based on the results, recommendations are made for the best adaptation of the MIP formulation paradigm for the considered problems.

[1]  Peter B. Luh,et al.  Scheduling products with bills of materials using an improved Lagrangian relaxation technique , 1994, IEEE Trans. Robotics Autom..

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

[3]  Ahmet B. Keha,et al.  Mixed integer programming formulations for single machine scheduling problems , 2009, Comput. Ind. Eng..

[4]  I. Choi,et al.  A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups , 2002 .

[5]  Leyuan Shi,et al.  On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems , 2007, Math. Program..

[6]  Maurice Queyranne,et al.  Single-Machine Scheduling Polyhedra with Precedence Constraints , 1991, Math. Oper. Res..

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

[8]  Lars Mönch,et al.  Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective , 2013, Comput. Oper. Res..

[9]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[10]  C. N. Potts,et al.  An algorithm for the single machine sequencing problem with precedence constraints , 1980 .

[11]  George L. Nemhauser,et al.  A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times , 1992 .

[12]  Shi-Chung Chang,et al.  Scheduling flexible flow shops with sequence-dependent setup effects , 2000, IEEE Trans. Robotics Autom..

[13]  Ruslan Sadykov.  Integer programming-based decomposition approaches for solving machine scheduling problems , 2006 .

[14]  Jesper Larsen,et al.  Parallelization of the Vehicle Routing Problem with Time Windows , 1999 .

[15]  Jonathan F. Bard,et al.  The Flow Shop Scheduling Polyhedron with Setup Times , 2003, J. Comb. Optim..

[16]  Zhiwei Zhu,et al.  Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach , 2000 .

[17]  Bilal Toklu,et al.  Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect , 2012 .

[18]  Peter B. Luh,et al.  An effective approach for job-shop scheduling with uncertain processing requirements , 1999, IEEE Trans. Robotics Autom..

[19]  Matteo Fischetti,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut , 2022 .

[20]  Meng-Ye Lin,et al.  Efficient mixed integer programming models for family scheduling problems , 2017 .

[21]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[22]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[23]  Shunji Tanaka,et al.  An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times , 2013, Comput. Oper. Res..

[24]  Oliver Herr,et al.  Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints , 2016, Eur. J. Oper. Res..

[25]  Peter B. Luh,et al.  An alternative framework to Lagrangian relaxation approach for job shop scheduling , 2003, Eur. J. Oper. Res..

[26]  Egon Balas,et al.  Job shop scheduling with setup times, deadlines and precedence constraints , 2008, J. Sched..

[27]  Artur Alves Pessoa,et al.  The time dependent traveling salesman problem: polyhedra and algorithm , 2013, Math. Program. Comput..

[28]  Peter B. Luh,et al.  Scheduling Job Shops with Batch Machines Using the Lagrangian Relaxation Technique , 1997, Eur. J. Control.

[29]  Thiago Henrique Nogueira,et al.  Mathematical model applied to single-track line scheduling problem in Brazilian railways , 2015, 4OR.

[30]  Francis Sourd,et al.  New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling , 2009, INFORMS J. Comput..

[31]  Peter B. Luh,et al.  An effective optimization-based algorithm for job shop scheduling with fixed-size transfer lots , 1999 .

[32]  Maurice Queyranne,et al.  Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling , 1992, IPCO.

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

[34]  Marcus Poggi de Aragão,et al.  Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems , 2010, Math. Program. Comput..

[35]  José Elias Claudio Arroyo,et al.  ILS Heuristics for the Single-Machine Scheduling Problem with Sequence-Dependent Family Setup Times to Minimize Total Tardiness , 2016, J. Appl. Math..

[36]  Scott J. Mason,et al.  Parallel machine scheduling subject to auxiliary resource constraints , 2007 .

[37]  Shunji Tanaka,et al.  A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines , 2008 .

[38]  Martin W. P. Savelsbergh,et al.  A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties , 2015 .

[39]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[40]  Moshe Dror,et al.  Mathematical programming formulations for machine scheduling: A survey , 1991 .

[41]  Geraldo Robson Mateus,et al.  A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times , 2010, Comput. Oper. Res..

[42]  Maurice Queyranne,et al.  Polyhedral Approaches to Machine Scheduling , 2008 .

[43]  Ketan Khowala,et al.  A COMPARISON OF DIFFERENT FORMULATIONS FOR THE NON-PREEMPTIVE SINGLE MACHINE TOTAL WEIGHTED TARDINESS SCHEDULING PROBLEM , 2008 .

[44]  Tariq S. Abdul-Razaq and Faez H. Ali,et al.  Algorithms for Scheduling a Single Machine to Minimize Total Completion Time and Total Tardiness , 2016 .

[45]  Eric Pinson,et al.  Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates , 2010, Eur. J. Oper. Res..

[46]  E. Balas.  On the facial structure of scheduling polyhedra , 1985 .

[47]  Anand Subramanian,et al.  Exact algorithms for the traveling salesman problem with draft limits , 2014, Eur. J. Oper. Res..

[48]  Peter Brucker,et al.  Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.

[49]  D. Oudheusden,et al.  Parallel machine scheduling by family batching with sequence-independent set-up times , 2006 .

[50]  Martín Gómez Ravetti,et al.  Time-indexed formulation and polynomial time heuristic for a multi-dock truck scheduling problem in a cross-docking centre , 2016, Comput. Ind. Eng..

[51]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[52]  Peter B. Luh,et al.  An effective method to reduce inventory in job shops , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[53]  Rym M'Hallah,et al.  Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem , 2016, J. Sched..

[54]  P. Luh,et al.  Job shop scheduling with group-dependent setups, finite buffers, and long time horizon , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[55]  Amir-Mohammad Golmohammadi,et al.  A genetic algorithm for preemptive scheduling of a single machine , 2016 .

[56]  Stephen C. Graves,et al.  Technical Note - An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem , 1980, Oper. Res..

[57]  Artur Alves Pessoa,et al.  The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm , 2010, SEA.

[58]  Carla Seatzu,et al.  Job-shop scheduling models with set-up times , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[59]  Arben Asllani,et al.  Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming , 2004 .

[60]  Ruslan Sadykov,et al.  Column Generation for Extended Formulations , 2011, Electron. Notes Discret. Math..

[61]  Roberto Musmanno,et al.  Robust scheduling of parallel machines with sequence-dependent set-up costs , 2005, Eur. J. Oper. Res..

[62]  Anna Sciomachen,et al.  A mixed-integer model for solving ordering problems with side constraints , 1997, Ann. Oper. Res..

[63]  Panos M. Pardalos,et al.  Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times , 2008, Comput. Oper. Res..

[64]  L. V. Wassenhove,et al.  An algorithm for single machine sequencing with deadlines to minimize total weighted completion time , 1983 .

[65]  C. Klein,et al.  Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness , 1999 .

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

[67]  D.J. Hoitomt,et al.  Scheduling jobs with simple precedence constraints on parallel machines , 1990, IEEE Control Systems Magazine.

[68]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[69]  Tamer Eren,et al.  A bicriteria scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[70]  Martin W. P. Savelsbergh,et al.  A polyhedral approach to single-machine scheduling problems , 1999, Math. Program..

[71]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[72]  Johnny C. Ho,et al.  Minimizing the number of tardy jobs for m parallel machines , 1995 .

[73]  Andrew Wirth,et al.  Scheduling parallel machines with a single server: some solvable cases and heuristics , 2002, Comput. Oper. Res..

[74]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..

[75]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[76]  Stéphane Dauzère-Pérès,et al.  Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine , 2003 .

[77]  Gilles Savard,et al.  The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times , 2006, Discret. Optim..

[78]  Gilles Savard,et al.  Time-Indexed Formulations and the Total Weighted Tardiness Problem , 2005, INFORMS J. Comput..

[79]  Temel Öncan,et al.  A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..

[80]  M. Zandieh,et al.  Modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time , 2011 .

[81]  Krishna R. Pattipati,et al.  A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..

[82]  Wang Shufeng,et al.  Scheduling to minimize the maximum lateness with multiple product classes in batch processing , 2002, 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering. TENCOM '02. Proceedings..

[83]  Débora P. Ronconi,et al.  Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date , 2009, Comput. Oper. Res..

[84]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[85]  Roman Buil,et al.  Improvement of Lagrangian Relaxation Convergence for Production Scheduling , 2012, IEEE Transactions on Automation Science and Engineering.

[86]  Fabrice Talla Nobibon,et al.  Exact algorithms for single-machine scheduling with time windows and precedence constraints , 2015, Journal of Scheduling.

[87]  van Ca Cleola Eijl.  A polyhedral approach to the delivery man problem , 1995 .

[88]  José M. Valério de Carvalho,et al.  A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times , 2007, Eur. J. Oper. Res..

[89]  Shunji Tanaka,et al.  An exact algorithm for single-machine scheduling without machine idle time , 2009, J. Sched..

[90]  Kristina Soric.  A cutting plane algorithm for a single machine scheduling problem , 2000, Eur. J. Oper. Res..

[91]  J. Carlier,et al.  Structural properties of optimal schedules with preemption , 2010 .

[93]  Pasquale Avella,et al.  Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems , 2005, INFORMS J. Comput..

[94]  Hung-Liang Cheng,et al.  A heuristic approach for single-machine scheduling with due dates and class setups , 2001, Comput. Oper. Res..

[95]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

[96]  Muminu O. Adamu,et al.  A survey of single machine scheduling to minimize weighted number of tardy jobs , 2013 .

[97]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[98]  Fan T. Tseng,et al.  Two models for a family of flowshop sequencing problems , 2002, Eur. J. Oper. Res..

[99]  Peter B. Luh,et al.  Scheduling of manufacturing systems using the Lagrangian relaxation technique , 1991, IEEE Trans. Autom. Control..

[100]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[101]  Scott J. Mason,et al.  Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems , 2010, Comput. Ind. Eng..