A binary branch and bound algorithm to minimize maximum scheduling cost

Abstract This paper examines a single machine scheduling problem of minimizing the maximum scheduling cost that is nondecreasing with job completion time. Job release dates and precedence constraints are considered. We assume that each job can be processed exactly once without preemption. This is a classical scheduling problem, and is specifically useful in the scheduling of medical treatments. We develop a simple branch and bound algorithm to solve the scheduling problem optimally. A binary branching technique is developed. We use a preemptive solution approach to locate a lower bound, and design a simple heuristic to find an upper bound. Our algorithm is easy to implement and finds optimal schedules in one CPU minute for almost all instances tested, with up to 1000 jobs.

[1]  E. Nowicki,et al.  A block approach for single-machine scheduling with release dates and due dates , 1986 .

[2]  Zhixin Liu,et al.  Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints , 2010, Comput. Oper. Res..

[3]  Chris N. Potts,et al.  Rescheduling for Multiple New Orders , 2007, INFORMS J. Comput..

[4]  Kenneth R. Baker,et al.  Sequencing with due-dates and early start times to minimize maximum tardiness , 1974 .

[5]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[6]  David B. Shmoys,et al.  Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better , 1992, Math. Oper. Res..

[7]  Jan Karel Lenstra,et al.  Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints , 1983, Oper. Res..

[8]  Stanislaw Zdrzalka,et al.  An algorithm for single machine sequencing with release dates to minimize maximum cost , 1989, Discret. Appl. Math..

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

[10]  Alessandro Agnetis,et al.  Scheduling Problems with Two Competing Agents , 2004, Oper. Res..

[11]  Christian Artigues,et al.  A branch and bound method for the job-shop problem with sequence-dependent setup times , 2008, Ann. Oper. Res..

[12]  Whm Henk Zijm,et al.  Single-machine scheduling with release dates, due dates and family setup times , 1994 .

[13]  Joseph Y.-T. Leung,et al.  Competitive Two-Agent Scheduling and Its Applications , 2010, Oper. Res..

[14]  B. J. Lageweg,et al.  Minimizing maximum lateness on one machine : Computational experience and some applications , 1976 .

[15]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[16]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

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

[18]  M. Vanhoucke,et al.  An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems , 2013 .

[19]  Clyde L. Monma,et al.  Sequencing to Minimize the Maximum Job Cost , 1980, Oper. Res..

[20]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[21]  Luis Puigjaner,et al.  Simultaneous production and logistics operations planning in semicontinuous food industries , 2012 .

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

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

[24]  Lixin Tang,et al.  A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry , 2007, Comput. Oper. Res..

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

[26]  C. N. Potts,et al.  Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times , 1980, Oper. Res..

[27]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[28]  E. Nowicki,et al.  A note on minimizing maximum lateness in a one-machine sequencing problem with release dates , 1986 .

[29]  J. Carlier.  The one-machine sequencing problem , 1982 .

[30]  Malgorzata Sterna,et al.  A survey of scheduling problems with late work criteria , 2011 .

[31]  David S. Johnson,et al.  Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[32]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..