Skip to main content
SpringerLink
Log in

Semi-online scheduling problems on a small number of machines

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a priori information: the total processing time, the largest processing time, the combination of the previous two or the optimal makespan. We propose a new algorithm that can be applied to the problem with the known total or largest processing time and prove that it has improved competitive ratios for the cases with a small number of machines. Improved lower bounds of the competitive ratio are also provided by presenting adversary lower bound examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Albers, S. (1999). Better bounds for online scheduling. SIAM Journal on Computing, 29, 459–473.

    Article  Google Scholar 

  • Albers, S., & Hellwig, M. (2012). Semi-online scheduling revisited. Theoretical Computer Science, 443, 1–9.

    Article  Google Scholar 

  • Angelelli, E., Nagy, A. B., Speranza, M. G., & Zs, Tuza. (2004). The on-line multiprocessor scheduling problem with known sum of the tasks. Journal of Scheduling, 7, 421–428.

    Article  Google Scholar 

  • Angelelli, E., Speranza, M. G., & Zs, Tuza. (2007). Semi on-line scheduling on three processors with known sum of the tasks. Journal of Scheduling, 10, 263–269.

    Article  Google Scholar 

  • Azar, Y., & Regev, O. (2001). On-line bin-stretching. Theoretical Computer Science, 268, 17–41.

    Article  Google Scholar 

  • Bartal, Y., Fiat, A., Karloff, H., & Vohra, R. (1995). New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences, 51, 359–366.

    Article  Google Scholar 

  • Bartal, Y., Karloff, H., & Rabani, Y. (1994). A better lower bound for on-line scheduling. Information Processing Letters, 50, 113–116.

    Article  Google Scholar 

  • Cai, S. Y. (2002). Semi online scheduling on three identical machines. Journal of Wenzhou Teachers College, 23, 1–3. (In Chinese).

    Google Scholar 

  • Chang, S. Y., Hwang, H.-C., & Park, J. (2005). Semi-on-line parallel machines scheduling under known total and largest processing times. Journal of the Operations Research Society of Japan, 48, 1–8.

    Google Scholar 

  • Chen, B., Vliet, A., & Woeginger, G. J. (1994). New lower and upper bounds for on-line scheduling. Operations Research Letters, 16, 221–230.

    Article  Google Scholar 

  • Cheng, T. C. E., Kellerer, H., & Kotov, V. (2005). Semi-on-line multiprocessor scheduling with given total processing time. Theoretical Computer Science, 337, 134–146.

    Article  Google Scholar 

  • Faigle, U., Kern, W., & Turan, G. (1989). On the performance of on-line algorithms for partition problems. Acta Cybernetica, 9, 107–119.

    Google Scholar 

  • Fleischer, R., & Wahl, M. (2000). Online scheduling revisited. Journal of Scheduling, 3, 343–353.

    Article  Google Scholar 

  • Galambos, G., & Woeginger, G. J. (1993). An on-line scheduling heuristic with better worst case ratio than Graham’s list scheduling. SIAM Journal on Computing, 22, 349–355.

    Article  Google Scholar 

  • Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45, 1563–1581.

    Article  Google Scholar 

  • He, Y., & Zhang, G. C. (1999). Semi online scheduling on two identical machines. Computing, 62, 179–187.

    Article  Google Scholar 

  • Hua, R., Hu, J., & Lu, L. (2006). A semi-online algorithm for parallel machine scheduling on three machines. Journal of Industrial Engineering and, Engineering Management, 20 (in Chinese).

  • Karger, D., Phillips, S., & Torng, E. (1996). A better algorithm for an ancient scheduling problem. Journal of Algorithms, 20, 400–430.

    Google Scholar 

  • Kellerer, H., Kotov, V., Speranza, M. G., & Tuza, Zs. (1997). Semi on-line algorithms for the partitioning problem. Operations Research Letters, 21, 235–242.

    Article  Google Scholar 

  • Rudin, J. F. (2001). Improved bounds for the on-line scheduling problem. Ph.D. Thesis, The University of Texas, Dallas.

  • Rudin, J. F., & Chandrasekaran, R. (2003). Improved bounds for the online scheduling problem. SIAM Journal on Computing, 32, 717– 735.

    Article  Google Scholar 

  • Tan, Z. Y., & He, Y. (2002). Semi-on-line problems on two identical machines with combined partial information. Operations Research Letters, 30, 408–414.

    Article  Google Scholar 

  • Wu, Y., Huang, Y., & Yang, Q. F. (2008). Semi-online multiprocessor scheduling with the longest given processing time. Journal of Zhejiang University: Science Edition, 35, 23–26. (In Chinese).

    Google Scholar 

  • Wu, Y., Tan, Z., & Yang, Q. (2007). Optimal semi-online scheduling algorithms on a small number of machines. Lecture Notes in Computer Science, 4614, 504–515.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Supply Chain Management & Marketing Sciences, Rutgers Business School, 1 Washington Park, Newark, NJ, 07102, USA

    Kangbok Lee

  2. BK21 Project, Sogang Business School, Shinsu-dong 1, Mapo-gu, Seoul, 121-742, Republic of Korea

    Kyungkuk Lim

Authors
  1. Kangbok Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kyungkuk Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kyungkuk Lim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, K., Lim, K. Semi-online scheduling problems on a small number of machines. J Sched 16, 461–477 (2013). https://doi.org/10.1007/s10951-013-0329-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-013-0329-x

Keywords

Search

Navigation