Skip to main content
SpringerLink
Log in

Better permutations for the single-processor scheduling with time restrictions

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we consider single-processor scheduling with time restrictions. Given a fixed integer \(B\ge 2\) and a set of jobs, we need to schedule the jobs sequentially on a single processor subject to the following B-constraint. For any real x, no unit time interval \([x, x+1)\) is allowed to intersect more than B jobs. We show that there exists a permutation of the jobs which can be processed within a factor of \(\frac{5}{4}\) of the optimum (plus an additional small constant) when \(B\ge 5\) and this factor is best possible. When \(B=3, 4\), the corresponding factor equals \(\frac{B}{B-1}\). Furthermore, we present an asymptotically optimal permutation for \(B=2\). The results for \(B\ge 4\) improve the previous work on this problem.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Braun, O., Chung, F., Graham, R.: Single-processor scheduling with time restrictions. J. Sched. 17, 399–403 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. Leung, J.Y.-T.: Handbook of scheduling. Chapman and Hall, Boca Raton (2004)

    MATH  Google Scholar 

  3. Edis, P.B., Oguz, C., Ozkarahan, I.: Parallel machine scheduling with additional resources: Notation, classification, models and solution methods. Eur. J. Oper. Res. 230, 449–463 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Slowinski, R.: Two approaches to problems of resource allocation among project activities—a comparative study. J. Oper. Res. Soc. 31(8), 711–723 (1980)

    MathSciNet  MATH  Google Scholar 

  5. Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on scheduling. Springer-Verlag, New York (Chapter 12) (2007)

  6. Blazewicz, J., Lenstra, J.K., Kan, A.H.G.R.: Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5(1), 11–24 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cardoen, B.: Operating room planning and scheduling solving a surgical case sequencing problem. 4OR-Q. J. Oper. Res. 8, 101–104 (2010)

    Article  MATH  Google Scholar 

  8. Cardoen, B., Demeulemeester, E., Beliën, J.: Operating room planning and scheduling: a literature review. Eur. J. Oper. Res. 201, 921–932 (2010)

    Article  MATH  Google Scholar 

  9. Braun, O., Chung, F., Graham, R.: Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions. OR Spect. 38, 531–540 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  10. Benmansour, R., Braun, O., Artiba, A.: On the single-processor scheduling problem with time restrictions. In: Procedings of control, decision and information technologies (CoDIT), pp. 242–245 (2014)

Download references

Acknowledgments

The authors would like to acknowledge the anonymous referees for their careful reading of our paper and their valuable comments.

Author information

Authors and Affiliations

  1. Department of Mathematics, Hangzhou Dianzi University, Hangzhou, 310018, People’s Republic of China

    An Zhang, Feilang Ye & Yong Chen

  2. Taizhou University, Linhai, 317000, Zhejiang, People’s Republic of China

    Guangting Chen

Authors
  1. An Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feilang Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guangting Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to An Zhang or Guangting Chen.

Additional information

Supported by the National Natural Science Foundation of China (11201105) and the Zhejiang Provincial Natural Science Foundation of China (LY16A010015). Supported by the National Natural Science Foundation of China (11401149). Supported by the National Natural Science Foundation of China (11571252).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, A., Ye, F., Chen, Y. et al. Better permutations for the single-processor scheduling with time restrictions. Optim Lett 11, 715–724 (2017). https://doi.org/10.1007/s11590-016-1038-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-016-1038-0

Keywords

Search

Navigation