Abstract
We consider two-level supply chain scheduling problems where customers release jobs to a manufacturer that has to process the jobs and deliver them to the customers. Processed jobs are grouped into batches, which are delivered to the customers as single shipments. The objective is to minimize the total cost which is the sum of the total flow time and the total delivery cost. Such problems have been considered in the off-line environment where future jobs are known, and in the online environment where at any time there is no information about future jobs. It is known that the best possible competitive ratio for an online algorithm is 2. We consider the problem in the semi-online environment, assuming that a lower bound P for all processing times is available a priori, and present a semi-online algorithm with competitive ratio \(\frac{2D}{D+P}\) where D is the cost of a delivery. Also, for the special case where all processing times are equal, we prove that the algorithm is \(1.045\sqrt{\frac{2-u}{u}}\)-competitive, where u is the density of the instance.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Averbakh, I., & Xue, Z. (2007). Online supply chain scheduling problems with preemption. European Journal of Operational Research, 181, 500–504.
Averbakh, I. (2010). Online integrated production-distribution scheduling problems with capacitated deliveries. European Journal of Operational Research, 200(2), 377–384.
Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press.
Chen, Z.-L. (2010). Integrated production and outbound scheduling: review and extensions. Operations Research, 58(1), 130–148.
Chen, Z.-L., & Hall, N. (2007). Supply chain scheduling: conflict and cooperation in assembly systems. Operations Research, 55, 1072–1089.
Chen, Z.-L., & Pundoor, G. (2006). Order assignment and scheduling in a supply chain. Operations Research, 54, 555–572.
Fu, R., Ji, T., Yuan, J., & Lin, Y. (2007). On-line scheduling in a parallel batch processing system to minimize makespan using restarts. Theoretical Computer Science, 374, 196–202.
Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: batching and delivery. Operations Research, 51(4), 566–584.
Hall, N. G., & Potts, C. N. (2005). The coordination of scheduling and batch deliveries. Annals of Operations Research, 135, 41–64.
Hoogeveen, J. A., & Vestjens, A. P. A. (2000). A best possible on-line algorithm for minimizing maximum delivery time on a single machine. SIAM Journal on Discrete Mathematics, 13(1), 56–63.
Ivanov, D., & Sokolov, B. (2010a). Dynamic supply chain scheduling. Journal of Scheduling, to appear. doi:10.1007/s10951-010-01891-6.
Ivanov, D., & Sokolov, B. (2010b). Adaptive supply chain management. Berlin: Springer.
Lee, C.-Y., & Chen, Z.-L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3–24.
Pruhs, K., Sgall, J., & Torng, E. (2004). On-line scheduling. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis (pp. 15.1–15.41). Boca Raton: CRC Press. Chap. 15.
Tian, J., Fu, R., & Yuan, J. (2007). On-line scheduling with delivery time on a single batch machine. Theoretical Computer Science, 374, 49–57.
van den Akker, M., Hoogeveen, H., & Vakhania, N. (2000). Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Journal of Scheduling, 3, 333–341.
Acknowledgements
This work was supported by a grant from the Natural Sciences and Engineering Research Council of Canada (NSERC) to Igor Averbakh.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Averbakh, I., Baysan, M. Semi-online two-level supply chain scheduling problems. J Sched 15, 381–390 (2012). https://doi.org/10.1007/s10951-011-0264-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-011-0264-7