Online integrated production–distribution scheduling problems without preemption

We study an integrated production–distribution scheduling problem where jobs are released by customers to a manufacturer over time. The jobs are released online, that is, at any time the information of the number, release and processing times of future jobs is unknown, and the processing time of a job becomes known when the job is released. The manufacturer processes the jobs on a single machine. During the processing of jobs preemption is not allowed. Completed jobs are delivered in batches to customers via sufficient capacitated vehicles. For the objective of minimizing the sum of the total delivery time and the total distribution cost, we present a 3-competitive algorithm for the single-customer case and then extend the result to the multi-customer case. A lower bound of two on the competitive ratio of the problem is also given.

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

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

[3]  Igor Averbakh,et al.  Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem , 2013, Oper. Res. Lett..

[4]  George L. Vairaktarakis,et al.  Integrated Scheduling of Production and Distribution Operations , 2005, Manag. Sci..

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

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

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

[8]  Igor Averbakh,et al.  Semi-online two-level supply chain scheduling problems , 2012, J. Sched..

[9]  Igor Averbakh,et al.  On-line integrated production-distribution scheduling problems with capacitated deliveries , 2010, Eur. J. Oper. Res..

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

[11]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

[12]  Igor Averbakh,et al.  Batching and delivery in semi-online distribution systems , 2013, Discret. Appl. Math..

[13]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[14]  Han Hoogeveen,et al.  Optimal On-Line Algorithms for Single-Machine Scheduling , 1996, IPCO.

[15]  Long Wan,et al.  Integrated production and delivery scheduling on a serial batch machine to minimize the makespan , 2015, Theor. Comput. Sci..

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

[17]  Lei Lei,et al.  Integrated batch production and distribution scheduling with limited vehicle capacity , 2015 .

[18]  Ik Sun Lee,et al.  A coordinated scheduling of production-and-delivery under dynamic delivery cost environments , 2015, Comput. Ind. Eng..

[19]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[20]  Leen Stougie,et al.  A class of on-line scheduling algorithms to minimize total completion time , 2003, Oper. Res. Lett..

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