Integrated production and delivery scheduling on a serial batch machine to minimize the makespan

In this paper, we study the integrated production and delivery scheduling on a serial batch machine. The objective is to minimize the makespan, i.e., the maximum delivery completion time of the jobs. We consider four distinct problems which depend on whether split is allowed in the production or delivery of the jobs. We present a polynomial-time algorithm for the first problem and show that other three problems are strongly NP-hard. Furthermore, we provide effective approximation algorithms for the three NP-hard problems.

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

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

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

[4]  Xiwen Lu,et al.  Integrated scheduling of production and delivery on a single machine with availability constraint , 2015, Theor. Comput. Sci..

[5]  H. Hoogeveen,et al.  Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine , 2000, ESA.

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

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

[8]  Igor Averbakh,et al.  On-line supply chain scheduling problems with preemption , 2007, Eur. J. Oper. Res..

[9]  Jiawei Zhang,et al.  Parallel machine scheduling with splitting jobs , 2000, Discret. Appl. Math..

[10]  Guochuan Zhang,et al.  Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval , 2014, Inf. Sci..

[11]  Paolo Serafini,et al.  Scheduling Jobs on Several Machines with the Job Splitting Property , 1996, Oper. Res..

[12]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[13]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

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

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

[16]  Han Hoogeveen,et al.  A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine , 2000, SIAM J. Discret. Math..

[17]  Han Hoogeveen,et al.  Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine , 2000, ESA.

[18]  Jinjiang Yuan,et al.  Scheduling with families of jobs and delivery coordination under job availability , 2009, Theor. Comput. Sci..

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

[20]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[21]  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..

[22]  Zhi-Long Chen,et al.  Integrated Production and Outbound Distribution Scheduling: Review and Extensions , 2010, Oper. Res..

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Rui Zhang,et al.  Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains , 2009, J. Sched..