Scheduling with job delivery coordination on single machine

This paper investigates a single machine scheduling problem with job delivery coordination, in which each job demands different amount of storage space during transportation. In this problem, a set of independent jobs from a customer must first be processed on a machine without preemption and then delivered by two homogeneous vehicles to the customer in batches. To minimize the makespan, we develop a best possible polynomial-time heuristic with a worst-case ratio of 2.

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

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

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

[4]  Xiwen Lu,et al.  An improved approximation algorithm for single machine scheduling with job delivery , 2011, Theor. Comput. Sci..

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

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

[7]  Eun-Seok Kim,et al.  Coordinating multi-location production and customer delivery , 2013, Optim. Lett..

[8]  Yin-Feng Xu,et al.  Machine Scheduling with a Maintenance Interval and Job Delivery Coordination , 2015, FAW.

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

[10]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

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

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

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

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

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