Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan

A problem of parallel machine scheduling with coordinated job deliveries is handled to minimize the makespan. Different jobs call for dissimilar sizes of storing space in the process of transportation. A range of jobs of one customer in the problem have priority to be processed on two identical parallel machines without preemption and then delivered to the customer by two vehicles in batches. For this NP-hard problem, we first prove that it is impossible to have a polynomial heuristic with a worst-case performance ratio bound less than 2 unless P = NP. Thereafter, we develop a polynomial heuristic for this problem, the worst-case ratio of which is bounded by 2.

[1]  Christian A. Ullrich.  Integrated machine scheduling and vehicle routing with time windows , 2013, Eur. J. Oper. Res..

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

[3]  Guruprasad Pundoor,et al.  Integrated Order Scheduling and Packing , 2009 .

[4]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

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

[6]  Xiuli Wang,et al.  Machine scheduling with an availability constraint and job delivery coordination , 2007 .

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

[8]  Chris N. Potts,et al.  The Coordination of Scheduling and Batch Deliveries , 2005, Ann. Oper. Res..

[9]  Jason Chao-Hsien Pan,et al.  Two parallel machines problem with job delivery coordination and availability constraint , 2015, Ann. Oper. Res..

[10]  Dakui Jiang,et al.  Scheduling with job delivery coordination on single machine , 2018, Optim. Lett..

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

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

[13]  Zsolt Tuza,et al.  Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9 , 2013, Theor. Comput. Sci..

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

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