Solving an avionics real-time scheduling problem by advanced IP-methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6346 LNCS, Issue PART 1, 2010, Pages 11-22

  Eisenbrand, Friedrich ^a   Kesavan, Karthikeyan ^b   Mattikalli, Raju S ^b   Niemeier, Martin ^a   Nordsieck, Arnold W ^b   Skutella, Martin ^c   Verschae, José ^c   Wiese, Andreas ^c  

^a EPFL   (Switzerland)

^b BOEING COMPANY   (United States)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING FORMULATIONS; MEMORY USAGE; OPERATION CONTROL; OPTIMALITY; ORDERS OF MAGNITUDE; REAL TIME SCHEDULING; REAL-WORLD; SOFTWARE-BASED; STRUCTURAL INSIGHTS;

AIRCRAFT CONTROL; SOFTWARE DESIGN;

INTEGER PROGRAMMING;

EID: 78249240578     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15775-2_2     Document Type: Conference Paper

References (18)

1. Bhatia, R.: Approximation Algorithms for Scheduling Problems. PhD thesis, University of Maryland (1998)
2. 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)
3. Baruah, S., Rousier, L., Tulchinsky, I., Varvel, D.: The complexity of periodic maintenance. In: Proceedings of the International Computer Symposium (1990)
4. Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Springer, Heidelberg (2004)
5. Crainic, T.G., Perboli, G., Pezzuto, M., Tadei, R.: New bin packing fast lower bounds. Computers & Operations Research 34, 3439-3457 (2007) (Pubitemid 46517866)
6. 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)
7. Fleszar, K., Hindi, K.S.: New heuristics for one-dimensional bin-packing. Computers & Operations Research 29, 821-839 (2002)
8. Korst, J., Aarts, E., Lenstra, J.K.: Scheduling periodic tasks. INFORMS Journal on Computing 8, 428-435 (1996)
9. 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)
10. Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC, Boca Raton (2004)
11. 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)
12. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, revised edn. John Wiley & Sons, Chichester (November 1990)
13. 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)
14. Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics 41, 579-585 (1994)
15. Vanderbeck, F.: Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming 86, 565-594 (1999)
16. 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)
17. 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)
18. Wei, W.D., Liu, C.L.: On a periodic maintenance problem. Operations Research Letters 2, 90-93 (1983)