Skip to main content
SpringerLink
Log in

Interval Scheduling on identical machines

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Interval Scheduling problems (IS) address the situation where jobs with fixed start and fixed end times are to be processed on parallel identical machines. The optimization criteria of interest are the maximization of the number of jobs completed and, in case weights are associated with jobs, the subset of jobs with maximal total weight. We present polynomial solutions to several IS problems and study computational complexity issues in the situation where bounds are imposed on the total operating time of the machines. With this constraint, we show that tractability is achieved again when job preemption is allowed.

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

Similar content being viewed by others

References

  • Arkin, A.M. and Silverberg, E.L. (1987), Scheduling Jobs with Fixed Start and End Times, Discrete Applied Mathematics, 18, 1–8.

    Google Scholar 

  • Carter, M.W. and Tovey, C.A. (1992), When is the Classroom Assignment Problem Hard? Operations Research, 40, Suppl. No 1, 28–39.

    Google Scholar 

  • Dondeti, V.R. and Emmons, H. (1992). Fixed job Scheduling with Two types of Processors, Operations Research, 40, Supp. No 1, 76–85.

    Google Scholar 

  • Fischetti, M., Martello, S. and Toth, P. (1989), The Fixed Job Schedule Problem with Working Time Constraints, Operations Research, 3, 395–403.

    Google Scholar 

  • Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.

    Google Scholar 

  • Golumbic, M.C. (1980), Algorithmic Graph Theory and Perfect Graphs, Academic Press

  • Kolen, A.J.W. and Kroon, L.G. (1991), On the Computational Complexity of (Maximum) Class Scheduling, European Journal Of Operations Research, 54, 23–38.

    Google Scholar 

  • Kolen, A.J.W., Lenstra, J.K. and Papadimitriou, C.H. (1986), Interval Scheduling Problems, Manuscript, Centre for Mathematics and Computer Science, C.W.I., Kruislaan 413, 1098 SJ Amsterdam.

    Google Scholar 

  • Martello, S. and Toth, P. (1986), A Heuristic Approach to the Bus Driver Scheduling Problem, European Journal Of Operations Research, 24, 106–117.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Risk Management Solutions Inc., 149 Commonwealth Drive, 94025, Menlo Park, California, USA

    Khalid I. Bouzina (Senior Analyst)

  2. Department of Operations Research, Case Western Reserve University, 44106-7235, Cleveland, Ohio, USA

    Hamilton Emmons (Professor and Chairman)

Authors
  1. Khalid I. Bouzina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hamilton Emmons
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bouzina, K.I., Emmons, H. Interval Scheduling on identical machines. J Glob Optim 9, 379–393 (1996). https://doi.org/10.1007/BF00121680

Download citation

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00121680

Key Words

Search

Navigation