Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods

  • Friedrich Eisenbrand
  • Karthikeyan Kesavan
  • Raju S. Mattikalli
  • Martin Niemeier
  • Arnold W. Nordsieck
  • Martin Skutella
  • José Verschae
  • Andreas Wiese
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6346)

Abstract

We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a minimum number of machines and offsets of the tasks have to be computed. The tasks emit jobs periodically starting at their offset and then need to be executed on the machines without any delay. Also, further constraints in terms of memory usage and redundancy requirements have to be met. Approaches based on standard integer programming formulations fail to solve our real-world instances. By exploiting structural insights of the problem we obtain an IP-formulation and primal heuristics that together solve the real-world instances to optimality and outperform text-book approaches by several orders of magnitude. Our methods lead, for the first time, to an industry strength tool to optimally schedule aircraft sized problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bha98]
    Bhatia, R.: Approximation Algorithms for Scheduling Problems. PhD thesis, University of Maryland (1998)Google Scholar
  2. [BHR93]
    Baruah, S.K., Howell, R.R., Rosier, L.E.: Feasibility problems for recurring tasks on one processor. In: Selected papers of the 15th International Symposium on Mathematical Foundations of Computer Science, pp. 3–20. Elsevier, Amsterdam (1993)Google Scholar
  3. [BRTV90]
    Baruah, S., Rousier, L., Tulchinsky, I., Varvel, D.: The complexity of periodic maintenance. In: Proceedings of the International Computer Symposium (1990)Google Scholar
  4. [But04]
    Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Springer, Heidelberg (2004)Google Scholar
  5. [CPPT07]
    Crainic, T.G., Perboli, G., Pezzuto, M., Tadei, R.: New bin packing fast lower bounds. Computers & Operations Research 34, 3439–3457 (2007)MATHCrossRefMathSciNetGoogle Scholar
  6. [EHN+10]
    Eisenbrand, F., Hähnle, N., Niemeier, M., Skutella, M., Verschae, J., Wiese, A.: Scheduling periodic tasks in a hard real-time environment. In: Proceedings of ICALP 2010. LNCS. Springer, Heidelberg (2010) (to appear)Google Scholar
  7. [FH02]
    Fleszar, K., Hindi, K.S.: New heuristics for one-dimensional bin-packing. Computers & Operations Research 29, 821–839 (2002)MATHCrossRefGoogle Scholar
  8. [KAL96]
    Korst, J., Aarts, E., Lenstra, J.K.: Scheduling periodic tasks. INFORMS Journal on Computing 8, 428–435 (1996)MATHCrossRefGoogle Scholar
  9. [KALW91]
    Korst, J., Aarts, E., Lenstra, J.K., Wessels, J.: Periodic multiprocessor scheduling. In: Aarts, E.H.L., Rem, M., van Leeuwen, J. (eds.) PARLE 1991. LNCS, vol. 505, pp. 166–178. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  10. [Leu04]
    Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC, Boca Raton (2004)MATHGoogle Scholar
  11. [LGW08]
    Loh, K.-H., Golden, B., Wasil, E.: Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research 35, 2283–2291 (2008)MATHCrossRefMathSciNetGoogle Scholar
  12. [MT90]
    Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, revised edn. John Wiley & Sons, Chichester (November 1990)Google Scholar
  13. [SKJ97]
    Scholl, A., Klein, R., Jürgens, C.: BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research 24, 627–645 (1997)MATHCrossRefGoogle Scholar
  14. [SL94]
    Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics 41, 579–585 (1994)MATHCrossRefMathSciNetGoogle Scholar
  15. [Van99]
    Vanderbeck, F.: Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming 86, 565–594 (1999)MATHCrossRefMathSciNetGoogle Scholar
  16. [VBJN94]
    Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L.: Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 3, 111–130 (1994)MATHCrossRefMathSciNetGoogle Scholar
  17. [VdC99]
    Valério de Carvalho, J.M.: Exact solution of bin packing problems using column generation and branch and bound. Annals of Operations Research 86, 629–659 (1999)MATHCrossRefMathSciNetGoogle Scholar
  18. [WL83]
    Wei, W.D., Liu, C.L.: On a periodic maintenance problem. Operations Research Letters 2, 90–93 (1983)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Friedrich Eisenbrand
    • 1
  • Karthikeyan Kesavan
    • 2
  • Raju S. Mattikalli
    • 2
  • Martin Niemeier
    • 1
  • Arnold W. Nordsieck
    • 2
  • Martin Skutella
    • 3
  • José Verschae
    • 3
  • Andreas Wiese
    • 3
  1. 1.EPFLLausanneSwitzerland
  2. 2.BoeingUSA
  3. 3.TU BerlinGermany

Personalised recommendations