You have free access to this content

Interval scheduling: A survey

  1. Antoon W.J. Kolen1,†,
  2. Jan Karel Lenstra2,
  3. Christos H. Papadimitriou3,
  4. Frits C.R. Spieksma4,*

Article first published online: 16 MAR 2007

DOI: 10.1002/nav.20231

Issue

Naval Research Logistics (NRL)

Naval Research Logistics (NRL)

Volume 54, Issue 5, pages 530–543, August 2007

Additional Information

How to Cite

Kolen, A. W.J., Lenstra, J. K., Papadimitriou, C. H. and Spieksma, F. C.R. (2007), Interval scheduling: A survey. Naval Research Logistics, 54: 530–543. doi: 10.1002/nav.20231

Author Information

  1. 1

    Department of Quantitative Economics, Maastricht University, NL-6200 MD Maastricht, The Netherlands

  2. 2

    Center for Mathematics and Computer Science, NL-1090 GB Amsterdam, The Netherlands

  3. 3

    Computer Science Division, University of California, Berkeley, California 94720

  4. 4

    Department of Operations Research and Business Statistics, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000, Leuven, Belgium

  1. †

    Antoon Kolen sadly passed away on October 3, 2004. His coauthors dedicate their contribution to this paper to his memory.

*Department of Operations Research and Business Statistics, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000, Leuven, Belgium

Publication History

  1. Issue published online: 2 JUL 2007
  2. Article first published online: 16 MAR 2007
  3. Manuscript Accepted: 27 JAN 2007
  4. Manuscript Revised: 26 JAN 2007
  5. Manuscript Received: 13 SEP 2005

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (234K)

REFERENCES

  • 1
    R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network flows, Prentice Hall, New Jersey, 1993.
  • 2
    J. M. Anthonisse, J. K. Lenstra, Operational operations research at the mathematical centre, Eur J Oper Res 15 ( 1984), 293–296.
  • 3
    E. M. Arkin, E. B. Silverberg, Scheduling with fixed start and end times, Discrete Appl Math 18 ( 1987), 1–8.
  • 4
    A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. S. Naor, B. Schieber, A unified approach to approximating resource allocation and scheduling, J ACM 48 ( 2005), 1069–1090.
  • 5
    A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, B. Schieber, Bandwith allocation with preemption, SIAM J Comput 28 ( 2005), 1806–1828.
  • 6
    A. Bar-Noy, S. Guha, J. S. Naor, B. Schieber, Approximating the throughput of multiple machines in real-time scheduling, SIAM J Comput 31 ( 2001), 331–352.
  • 7
    J. E. Beasley, B. Cao, A dynamic programming based algorithm for the crew scheduling problem, Comput Oper Res 25 ( 1998), 567–582.
  • 8
    P. Berman, B. DasGupta, Multi-phase algorithms for throughput maximization for real-time scheduling, Journal of Combinatorial Optimization 4 ( 2000), 307–323.
  • 9
    R. Bhatia, J. Chuzhoy, A. Freund, J. Naor, “ Algorithmic aspects of bandwidth trading,”In: Proceedings of the 30th International Conference on Automata, Languages, and Programming, Eindhoven, The Netherlands, Lecture Notes Comput Sci, 2719, 2003, pp. 751–766.
  • 10
    M. Biró, M. Hujter, Zs. Tuza, Precoloring extensions. I. Interval graphs, Discrete Math 100 ( 1992), 267–279.
  • 11
    A. Borodin, R. El-Yaniv, On-Line computation and competitive analysis, Cambridge University Press, Cambridge, 1988.
  • 12
    K. I. Bouzina, On interval scheduling problems: A contribution, Ph.D. Thesis, Case Western Reserve University, Cleveland, Ohio, 1994.
  • 13
    K. I. Bouzina, H. Emmons, Interval scheduling on identical machines, J Global Optim 9 ( 1996), 379–393.
  • 14
    M. Brehob, S. Wagner, E. Torng, R. Enbody, Optimal replacement is NP-hard for nonstandard caches, IEEE Trans Comput 53 ( 2004), 73–76.
  • 15
    P. Brucker, L. Nordmann, The k-track assignment problem, Computing 54 ( 1994), 97–122.
  • 16
    R. Canetti, S. Irani, Bounding the power of preemption in randomized scheduling, SIAM J Comput 27 ( 1998), 993–1015.
  • 17
    M. C. Carlisle, E. L. Lloyd, On the k-coloring of intervals, Discrete Appl Math 59 ( 1995), 225–235.
  • 18
    M. W. Carter, C. A. Tovey, When is the classroom assignment problem hard?, Oper Res 40 ( 1992), S28–S39.
  • 19
    Z. Chen, G. Lin, R. Rizzi, J. Wen, D. Xu, Y. Xu, T. Jiang, More reliable protein NMR peak assignment via improved 2-interval scheduling, J Comput Biol 12 ( 2005), 129–146.
  • 20
    J. Chuzhoy, S. Guha, S. Khanna, J. S. Naor, “ Machine minimization for scheduling jobs with interval constraints”, In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, Rome, Italy, 2004, pp. 81–90.
  • 21
    J. Chuzhoy, J. S. Naor, “ New hardness results for congestion minimization and machine scheduling”, In: Proceedings of the 36th ACM Symposium on the Theory of Computing, Chicago, Illinois, 2004, pp. 28–34.
  • 22
    J. Chuzhoy, R. Ostrovsky, Y. Rabani, Approximation algorithms for the job interval selection problem and related scheduling problems, Math of OR 31 ( 2006), 730–738.
  • 23
    M. Cieliebak, T. Erlebach, F. Hennecke, B. Weber, P. Widmayer, “ Scheduling with release times and deadlines on a minimum number of machines”, In: Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science, Toulouse, France, 2004, pp. 217–230.
  • 24
    G. B. Dantzig, D. R. Fulkerson, Minimizing the number of tankers to meet a fixed schedule, Nav Res Logist Q 1 ( 1954), 217–222.
    Direct Link:
  • 25
    E. Dekel, S. Sahni, Parallel scheduling algorithms, Oper Res 31 ( 1983), 24–49.
  • 26
    V. R. Dondeti, H. Emmons, Fixed job scheduling with two types of processors, Oper Res 40 ( 1992), S76–S85.
  • 27
    V. R. Dondeti, H. Emmons, Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times, Eur J Oper Res 70 ( 1993), 316–326.
  • 28
    T. Erlebach, F. C. R. Spieksma, Interval selection: applications, algorithms, and lower bounds, J Algorithm 46 ( 2003), 27–53.
  • 29
    U. Faigle, W. Kern, W. M. Nawijn, A greedy on-line algorithm for the k-track assignment problem, J Algorithm 31 ( 1999), 196–210.
  • 30
    U. Faigle, W. M. Nawijn, Note on scheduling intervals on-line, Discrete Appl Math 58 ( 1995), 13–17.
  • 31
    D. B. C. Faneyte, F. C. R. Spieksma, G. J. Woeginger, A branch-and-price algorithm for a hierarchical crew scheduling problem, Nav Res Logist 49 ( 2001), 743–759.
    Direct Link:
  • 32
    M. Fischetti, S. Martello, P. Toth, The fixed job schedule problem with spread-time constraints, Oper Res 35 ( 1987), 849–858.
  • 33
    M. Fischetti, S. Martello, P. Toth, The fixed job schedule problem with working-time constraints, Oper Res 37 ( 1989), 395–403.
  • 34
    M. Fischetti, S. Martello, P. Toth, Approximation algorithms for fixed job schedule problems, Oper Res 40 ( 1992), S96–S108.
  • 35
    L. R. FordJr., D. R. Fulkerson, Flows in networks, Princeton University Press, Princeton, New Jersey, 1962.
  • 36
    V. Gabrel, Scheduling jobs within time windows on identical parallel machines: New models and algorithms, Eur J Oper Res 83 ( 1995), 320–329.
  • 37
    M. R. Garey, D. S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, W.H. Freeman and Company, New York, 1979.
  • 38
    M. R. Garey, D. S. Johnson, G. L. Miller, C. H. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM J Algebr Discrete Math 1 ( 1980), 216–227.
  • 39
    I. Gertsbakh, H. I. Stern, Minimal resources for fixed and variable job schedules, Oper Res 26 ( 1978), 68–85.
  • 40
    M. C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, San Diego, California, 1980.
  • 41
    S. C.Graves, A. H. G.Rinnooy Kan, P. H.Zipkin (Editors), Logistics of production and inventory, Handbooks in Operations Research and Management Science, Volume 4, North-Holland, Amsterdam, 1993.
  • 42
    U. I. Gupta, D. T. Lee, J. Y.-T. Leung, An optimal solution for the channel-assignment problem, IEEE Trans Comput C-28 ( 1979), 807–810.
  • 43
    S. A. Goldman, J. Parwatikar, S. Suri, Online scheduling with hard deadlines, J Algorithm 34 ( 2000), 370–389.
  • 44
    N. G. Hall, M. Lesaoana, C. N. Potts, Scheduling with fixed delivery dates, Oper Res 49 ( 2001), 134–144.
  • 45
    A. Hashimoto, J. Stevens, Wire routing by optimizing channel assignment within large apertures, Proceedings of the 8th Design Automation Workshop, 1971, pp. 155–169.
  • 46
    D.Hochbaum (Editor), Approximation algorithms for NP-hard problems, PWS Publishing Company, Boston, 1997.
  • 47
    Q. Huang, E. Lloyd, “ Cost constrained fixed job scheduling,” In: Proceedings of the eighth Italian Conference on Theoretical Computer Science, Bertinoro, Italy, Lecture Notes Computer Sci 2841 ( 2003), 111–124.
  • 48
    T. Ibaraki, N. Katoh, Resource allocation problems: Algorithmic approaches, The MIT Press, Cambridge, 1988.
  • 49
    K. Jansen, An approximation algorithm for the license and shift class design problem, Eur J Oper Res 73 ( 1994), 127–131.
  • 50
    K. Jansen, Approximation results for the optimal cost chromatic partition problem, J Algorithm 34 ( 2000), 54–89.
  • 51
    J. M. Keil, On the complexity of scheduling tasks with discrete starting times, Oper Res Lett 12 ( 1992), 293–295.
  • 52
    A. W. J. Kolen, L. G. Kroon, On the computational complexity of (maximum) class scheduling, Eur J Oper Res 54 ( 1991), 23–38.
  • 53
    A. W. J. Kolen, L. G. Kroon, On the computational complexity of (maximum) shift scheduling, Eur J Oper Res 64 ( 1993), 138–151.
  • 54
    A. W. J. Kolen, L. G. Kroon, An analysis of shift class design problems, Eur J Oper Res 79 ( 1994), 471–430.
  • 55
    A. W. J. Kolen, J. K. Lenstra, “ Combinatorics in operations research,” Handbook of Combinatorics, R. L.Graham, M.Grötschel, L.Lovász (Editors), North-Holland, Amsterdam, 1995, pp. 1875–1910.
  • 56
    L. G. Kroon, M. Salomon, L. van Wassenhove, Exact and approximation algorithms for the operational fixed interval scheduling problem, Eur J Oper Res 82 ( 1995), 190–205.
  • 57
    L. G. Kroon, M. Salomon, L. van Wassenhove, Exact and approximation algorithms for the tactical fixed interval scheduling problem, Oper Res 45 ( 1997), 624–638.
  • 58
    L. G. Kroon, A. Sen, H. Deng, A. Roy, “ The optimal cost chromatic partition problem for trees and interval graphs,” In: Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, Como, Italy, 1197, Lecture Notes Comput Sci, 1996, 279–292.
  • 59
    V. Kumar, “ Approximating circular arc colouring and bandwidth allocation in all-optical ring networks,” Proceedings of the first APPROX Conference, Lecture Notes Comput Sci, Volume 1444, Springer, Heidelberg, 1998, pp. 147–158.
  • 60
    R. J. Lipton, A. Tomkins, “ Online interval scheduling”, Proceedings of the fifth annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, 1994, pp. 302–311.
  • 61
    S. Martello, P. Toth, A heuristic approach to the bus driver scheduling problem, Eur J Oper Res 24 ( 1986), 106–117.
  • 62
    A. Mingozzi, M. A. Boschetti, S. Ricciardelli, L. Bianco, A set partitioning approach to the crew scheduling problem, Oper Res 47 ( 1999), 873–888.
  • 63
    H. Miyazawa, T. Erlebach, An improved randomized on-line algorithm for a weighted interval selection problem, J Scheduling 7 ( 2004), 293–311.
  • 64
    K. Nakajima, S. L. Hakimi, Complexity results for scheduling tasks with discrete starting times, J Algorithm 3 ( 1982), 344–361.
  • 65
    K. Nakajima, S. L. Hakimi, J. K. Lenstra, Complexity results for scheduling tasks in fixed intervals on two types of machines, SIAM J Comput 11 ( 1982), 512–520.
  • 66
    C. H. Papadimitriou, Private communication to J.K. Lenstra, April 25, 1982.
  • 67
    S. S. Seiden, Randomized online interval scheduling, Oper Res Lett 22 ( 1998), 171–177.
  • 68
    J. Sgall, “ On-line scheduling – a survey,” Online Algorithms: The state of the art, Lecture Notes Comput Sci, Volume 1442, A.Fiat, G. J.Woeginger (Editors), Springer, Heidelberg, 1998, pp. 196–231.
  • 69
    F. C. R. Spieksma, On the approximability of an interval scheduling problem, J Scheduling 2 ( 1999), 215–227.
    Direct Link:
  • 70
    V. V. Vazirani, Approximation algorithms, Springer, Heidelberg, 2002.
  • 71
    G. J. Woeginger, On-line scheduling of jobs with fixed start and end times, Theor Comput Sci 130 ( 1994), 5–16.
Get PDF (234K)