A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times

This paper addresses scheduling a set of jobs with specified release times on a single machine for delivery in batches to customers or to other machines for further processing. This problem is a natural extension of minimizing the sum of flow times in the presence of release time by considering the possibility of delivering jobs in batches and introducing batch delivery costs. The scheduling objective adopted is that of minimizing the sum of flow times and delivery costs. The extended problem arises in the context of coordination between machine scheduling and a distribution system in a supply chain network. Structural properties of the problem are investigated and used to devise a branch-and-bound solution scheme. Computational experiments show significant improvement over an existing dynamic programming algorithm.

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

[2]  Chris N. Potts,et al.  On-line scheduling of a single machine to minimize total weighted completion time , 2002, SODA '02.

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

[4]  Mohammad Mahdavi Mazdeh,et al.  A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs , 2007, Eur. J. Oper. Res..

[5]  T. C. Edwin Cheng,et al.  Single machine scheduling with batch deliveries , 1996 .

[6]  Jitender S. Deogun.  On Scheduling with Ready Times to Minimize Mean Flow Time , 1983, Comput. J..

[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]  Joseph Y.-T. Leung,et al.  Two Machine Scheduling under Disruptions with Transportation Considerations , 2006, J. Sched..

[9]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[10]  Chengbin Chu.  Efficient heuristics to minimize total flow time with release dates , 1992, Oper. Res. Lett..

[11]  Jitender S. Deogun,et al.  Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time , 1981, SIAM J. Comput..

[12]  Lucio Bianco,et al.  Scheduling of a single machine to minimize total weighted completion time subject to release dates , 1982 .

[13]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

[14]  Mohammad Mahdavi Mazdeh,et al.  Minimizing the sum of flow times with batching and delivery in a supply chain , 2005 .

[15]  Chris N. Potts,et al.  Supply chain scheduling: Batching and delivery , 2003, Oper. Res..

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