Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time

In this paper, we consider the two-stage scheduling problem in which n jobs are first processed on m identical machines at a manufacturing facility and then delivered to their customers by one vehicle which can deliver one job at each shipment. In the problem, a set of n delivery times is given in advance, and in a schedule, the n delivery times should be assigned to the n jobs, respectively. The objective is to minimize the maximum delivery completion time, i.e., the time when all jobs are delivered to their respective customers and the vehicle returns to the facility. For this problem, we present a 3 2 -approximation algorithm and a polynomial-time approximation scheme. Scheduling with delivery coordination.Identical machines and assignable delivery times.Minimize the maximum delivery completion time.A 3/2-approximation algorithm and a PTAS.

[1]  Xiangtong Qi,et al.  Single machine scheduling with assignable due dates , 2002, Discret. Appl. Math..

[2]  Yong Chen,et al.  Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination , 2013, Theor. Comput. Sci..

[3]  Jinjiang Yuan,et al.  Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time , 2015, Theor. Comput. Sci..

[4]  Shanlin Yang,et al.  Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan , 2015, Eur. J. Oper. Res..

[5]  Nicholas G. Hall.  Scheduling Problems With Generalized Due Dates , 1986 .

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

[7]  Ameur Soukhal,et al.  A note on the complexity of flow shop scheduling with transportation constraints , 2007, Eur. J. Oper. Res..

[8]  Chung-Yee Lee,et al.  Machine scheduling with job delivery coordination , 2004, Eur. J. Oper. Res..

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

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

[11]  Zhiyi Tan,et al.  On the machine scheduling problem with job delivery coordination , 2007, Eur. J. Oper. Res..

[12]  Parkash Lal Maggu,et al.  On 3xn sequencing problem involving equivalent-job for a job-block with transportation-times of jobs , 1981 .

[13]  Gerhard J. Woeginger,et al.  heuristics for parallel machine scheduling with delivery times , 1994, Acta Informatica.

[14]  Jinjiang Yuan,et al.  Single machine scheduling with release dates and job delivery to minimize the makespan , 2008, Theor. Comput. Sci..

[15]  Joseph Y.-T. Leung,et al.  Two Machine Scheduling under Disruptions with Transportation Considerations , 2006, J. Sched..

[16]  Ameur Soukhal,et al.  Complexity of flow shop scheduling problems with transportation constraints , 2005, Eur. J. Oper. Res..

[17]  Yong He,et al.  Improved algorithms for two single machine scheduling problems , 2005, Theor. Comput. Sci..

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

[19]  Jinjiang Yuan,et al.  Single Machine Scheduling with Job Delivery to minimize makespan , 2008, Asia Pac. J. Oper. Res..

[20]  Jinjiang Yuan,et al.  Unbounded parallel batch scheduling with job delivery to minimize makespan , 2008, Oper. Res. Lett..

[21]  Tsung-Shin Hsu,et al.  A new heuristic algorithm for the machine scheduling problem with job delivery coordination , 2009, Theor. Comput. Sci..

[22]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).