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.
This work was partially supported by Berlin Mathematical School, by DFG research center Matheon in Berlin, by DFG Focus Program 1307 within the project “Algorithm Engineering for Real-time Scheduling and Routing”, and by the Swiss National Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhatia, R.: Approximation Algorithms for Scheduling Problems. PhD thesis, University of Maryland (1998)
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)
Baruah, S., Rousier, L., Tulchinsky, I., Varvel, D.: The complexity of periodic maintenance. In: Proceedings of the International Computer Symposium (1990)
Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Springer, Heidelberg (2004)
Crainic, T.G., Perboli, G., Pezzuto, M., Tadei, R.: New bin packing fast lower bounds. Computers & Operations Research 34, 3439–3457 (2007)
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)
Fleszar, K., Hindi, K.S.: New heuristics for one-dimensional bin-packing. Computers & Operations Research 29, 821–839 (2002)
Korst, J., Aarts, E., Lenstra, J.K.: Scheduling periodic tasks. INFORMS Journal on Computing 8, 428–435 (1996)
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)
Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC, Boca Raton (2004)
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)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, revised edn. John Wiley & Sons, Chichester (November 1990)
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)
Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics 41, 579–585 (1994)
Vanderbeck, F.: Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming 86, 565–594 (1999)
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)
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)
Wei, W.D., Liu, C.L.: On a periodic maintenance problem. Operations Research Letters 2, 90–93 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eisenbrand, F. et al. (2010). Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. In: de Berg, M., Meyer, U. (eds) Algorithms – ESA 2010. ESA 2010. Lecture Notes in Computer Science, vol 6346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15775-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-15775-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15774-5
Online ISBN: 978-3-642-15775-2
eBook Packages: Computer ScienceComputer Science (R0)