Abstract
This paper focuses on the scheduling problem on two parallel machines with delivery coordination. In particular, given a set of n jobs, we aim to find a schedule with a minimal makespan such that all jobs are first executed on two parallel machines then delivered at the destination with a transporter. This problem is known to be NP-hard Chang and Lee (Eur J Oper Res 158(2):470–487, 2004), cannot be solved with an approximation ratio strictly less than 3/2 unless P=NP. We close the gap by proposing a polynomial time algorithm whose approximation ratio is \(3/2+\varepsilon \) with \(\varepsilon >0\), improve the previous best ratio \(14/9 + \epsilon \).
Similar content being viewed by others
References
Chang Y-C, Lee C-Y (2004) Machine scheduling with job delivery coordination. Eur J Oper Res 158(2):470–487
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5(1):287–326
Dósa G, Li R, Han X, Tuza Z (2013) The tight bound of first fit decreasing bin-packing algorithm is FFD(I) \(< = 11/9{OPT(I)} + 6/9\). Theo Comput Sci 510:13–61
Hall LA, Shmoys DB (1992) Jackson’s rule for single-machine scheduling: making a good heuristic better. Math Oper Res 17(1):22–35
Hurink J, Knust S (2001) Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Appl Math 112(1–3):199–216
Johnson DS (2008) Bin packing. Springer, Boston, pp 1–99
Johnson DS, Demers AJ, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3(4):299–325
Kise H (1991) On an automated two-machine flowshop scheduling problem with infinite buffer. J Oper Res Soc Jpn 34:354–361
Lan Y, Han X, Zongtao W, Guo H, Chen X (2016) Complexity of problem TF2 \(\vert v=1, c=2\vert c_{\text{ max }}\). Inf Process Lett 116(1):65–69
Lee C-Y, Chen Z-L (2001) Machine scheduling with transportation considerations. J Sched 4(1):3–24
Li C-L, Vairaktarakis G, Lee C-Y (2005) Machine scheduling with deliveries to multiple customer locations. Eur J Oper Res 164(1):39–51
Potts CN (1980) Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper Res 28(6):1436–1441
Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120(2):228–249
Potts CN, Van Wassenhove LN (1992) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43(5):395–406
Su CS, Pan CH, Hsu TS (2009) A new heuristic algorithm for the machine scheduling problem with job delivery coordination. Theor Comput Sci 410(27):2581–2591
Wang L, Liu Z (2013) An improved algorithm for scheduling two identical machines with batch delivery consideration. Oper Res Trans 17(1):38–43
Webster S, Baker KR (1995) Scheduling groups of jobs on a single machine. Oper Res 43(4):692–703
Woeginger GJ (1994) Heuristics for parallel machine scheduling with delivery times. Acta Inf 31(6):503–512
Zhang Y, Zheng Q, Ren J, Zhang L (2015) An improved algorithm for the machine scheduling problem with job delivery coordination. In 12th International symposium on operations research and its applications in engineering, technology and management (ISORA 2015), pp 167–172
Zhong W, Dósa G, Tan Z (2007) On the machine scheduling problem with job delivery coordination. Eur J Oper Res 182(3):1057–1072
Acknowledgements
This research was partially supported by NSFC(11971091,11701062), Liaoning Natural Science Foundation(2019-MS-062).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Wang, Y., Lan, Y., Chen, X. et al. A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\). J Comb Optim 44, 2195–2206 (2022). https://doi.org/10.1007/s10878-020-00593-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00593-1