Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Averbakh I (2010) Online integrated production-distribution scheduling problems with capacitated deliveries. Eur J Oper Res 200:377–384
Averbakh I, Baysan M (2012) Semi-online two-level supply chain scheduling problems. J Sched 15(3):381–390
Averbakh I, Baysan M (2013a) Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem. Oper Res Lett 41(6):710–714
Averbakh I, Baysan M (2013b) Batching and delivery in semi-online distribution systems. Discret Appl Math 161:28–42
Averbakh I, Xue Z (2007) Online supply chain scheduling problems with preemption. Eur J Oper Res 181:500–504
Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge
Chen ZL (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130–148
Chen ZL, Vairaktarakis GL (2005) Integrated scheduling of production-distribution operations. Manag Sci 51(4):614–628
Fan J, Lu XW, Liu PH (2015) Integrated scheduling of production and delivery on a single machine with availability constraint. Theor Comput Sci 562:581–589
Gao S, Qi L, Lei L (2015) Integrated batch production and distribution scheduling with limited vehicle capacity. Int J Prod Econ 160:13–25
Hall NG, Potts CN (2003) Supply chain scheduling: batching and delivery. Oper Res 51(4):566–584
Hoogeveen JA, Vestjens APA (1996) Optimal on-line algorithms for single-machine scheduling. In: Proceedings 5th international conference on integer programming and combinatorial optimization, Vancouver, British Columbia, Canada, June 3–5 (1996) Lecture Notes in Computer Science 1084. Springer, Berlin, pp 404–414
Hoogeveen JA, Vestjens APA (2000) A best possible online algorithm for minimizing maximum delivery time on a single machine. SIAM J Discret Math 13(1):56–63
Lee IS (2015) A coordinated scheduling of production-and-delivery under dynamic delivery cost environments. Comput Ind Eng 81:22–35
Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343–362
Lu X, Sitters R, Stougie L (2003) A class of online scheduling algorithms to minimize total completion time. Oper Res Lett 31(3):232–236
Lu LF, Zhang LQ, Wan L (2015) Integrated production and delivery scheduling on a serial batch machine to minimize the makespan. Theor Comput Sci. doi:10.1016/j.tcs.2015.01.014
Pei J, Pardalos PM, Liu XB, Fan WJ, Yang SL (2014) Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. Eur J Oper Res. doi:10.1016/j.ejor.2014.11.034
Pruhs K, Sgall J, Torng E (2004) On-line scheduling. In: Leung Joseph Y-T (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Florida, pp 15.1–15.41 (Chapter 15)
van den Akker M, Hoogeveen H, Vakhania N (2000) Restarts can help in the online minimization of the maximum delivery time on a single machine. J Sched 3(6):333–341
Acknowledgments
The authors would like to thank the two anonymous reviewers for their helpful comments and suggestions. This work was partially supported by the National Natural Science Foundation of China under Grant Nos. 71071123, 11101326 and 71172189, and the Program for Changjiang Scholars and Innovative Research Team in University (IRT1173).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Feng, X., Cheng, Y., Zheng, F. et al. Online integrated production–distribution scheduling problems without preemption. J Comb Optim 31, 1569–1585 (2016). https://doi.org/10.1007/s10878-015-9841-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-015-9841-6