Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time

Abstract This paper addresses the problem of scheduling a set of jobs that are released over the time on a set of identical parallel machines, aiming at the minimization of the total weighted completion time. This problem, referred to as P | r j | ∑ w j C j , is of great importance in practice, because it models a variety of real-life applications. Despite its importance, the P | r j | ∑ w j C j has not received much attention in the recent literature. In this work, we fill this gap by proposing mixed integer linear programs and a tailored branch-and-price algorithm. Our branch-and-price relies on the decomposition of an arc-flow formulation and on the use of efficient exact and heuristic methods for solving the pricing subproblem. Computational experiments carried out on a set of randomly generated instances prove that the proposed methods can solve to the proven optimality instances with up to 200 jobs and 10 machines, and provide very low gaps for larger instances.

[1]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 1997, STOC '97.

[2]  Dominique Feillet,et al.  A tutorial on column generation and branch-and-price for vehicle routing problems , 2010, 4OR.

[3]  Philippe Baptiste,et al.  Lower bounds for parallel machine scheduling problems , 2008 .

[4]  Peter Brucker,et al.  Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates , 2005, ICCSA.

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

[6]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[7]  C. N. Potts,et al.  Scheduling with release dates on a single machine to minimize total weighted completion time , 1992, Discret. Appl. Math..

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

[9]  Leyuan Shi,et al.  New Hybrid Optimization Algorithms for Machine Scheduling Problems , 2008, IEEE Transactions on Automation Science and Engineering.

[10]  Randolph W. Hall,et al.  Handbook of healthcare system scheduling , 2012 .

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

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

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

[14]  Manuel Iori,et al.  Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization , 2021, Eur. J. Oper. Res..

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

[16]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[17]  Arthur Kramer,et al.  Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines , 2018, Eur. J. Oper. Res..

[18]  Manuel Iori,et al.  The Meet-in-the-Middle Principle for Cutting and Packing Problems , 2018, INFORMS J. Comput..

[19]  Laurence A. Wolsey,et al.  An exact algorithm for IP column generation , 1994, Oper. Res. Lett..

[20]  Mehdi Mrad,et al.  An Arc-Flow Model for the Makespan Minimization Problem on Identical Parallel Machines , 2018, IEEE Access.

[21]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[22]  Marek Chrobak,et al.  The complexity of mean flow time scheduling problems with release times , 2006, J. Sched..

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

[24]  Chengbin Chu,et al.  A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates , 2006, 2006 International Conference on Service Systems and Service Management.

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

[26]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

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

[28]  Chengbin Chu,et al.  New exact method to solve the Pm/rj/∑Cj schedule problem , 2006 .

[29]  Manuel Iori,et al.  Logic based Benders' decomposition for orthogonal stock cutting problems , 2017, Comput. Oper. Res..

[30]  Roel Leus,et al.  A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching , 2016, INFORMS J. Comput..

[31]  Joseph Y.-T. Leung,et al.  Minimizing Mean Flow Time with Release Time Constraint , 1990, Theor. Comput. Sci..

[32]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[33]  Shunji Tanaka,et al.  A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time , 2011, Journal of Scheduling.

[34]  Arthur Kramer,et al.  A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems , 2015, J. Sched..

[35]  Erik Demeulemeester,et al.  Personnel scheduling: A literature review , 2013, Eur. J. Oper. Res..

[36]  Manuel Iori,et al.  Bin packing and cutting stock problems: Mathematical models and exact algorithms , 2016, Eur. J. Oper. Res..

[37]  Han Hoogeveen,et al.  Parallel Machine Scheduling by Column Generation , 1999, Oper. Res..