{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T09:18:50Z","timestamp":1778577530682,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157745","type":"print"},{"value":"9783642157752","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_2","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"11-22","source":"Crossref","is-referenced-by-count":19,"title":["Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karthikeyan","family":"Kesavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raju S.","family":"Mattikalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Niemeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnold W.","family":"Nordsieck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Verschae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Bhatia, R.: Approximation Algorithms for Scheduling Problems. PhD thesis, University of Maryland (1998)"},{"key":"2_CR2","first-page":"3","volume-title":"Selected papers of the 15th International Symposium on Mathematical Foundations of Computer Science","author":"S.K. Baruah","year":"1993","unstructured":"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\u201320. Elsevier, Amsterdam (1993)"},{"key":"2_CR3","unstructured":"Baruah, S., Rousier, L., Tulchinsky, I., Varvel, D.: The complexity of periodic maintenance. In: Proceedings of the International Computer Symposium (1990)"},{"key":"2_CR4","volume-title":"Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications","author":"G.C. Buttazzo","year":"2004","unstructured":"Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Springer, Heidelberg (2004)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"3439","DOI":"10.1016\/j.cor.2006.02.007","volume":"34","author":"T.G. Crainic","year":"2007","unstructured":"Crainic, T.G., Perboli, G., Pezzuto, M., Tadei, R.: New bin packing fast lower bounds. Computers & Operations Research\u00a034, 3439\u20133457 (2007)","journal-title":"Computers & Operations Research"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., H\u00e4hnle, 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)","DOI":"10.1007\/978-3-642-14165-2_26"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K. Fleszar","year":"2002","unstructured":"Fleszar, K., Hindi, K.S.: New heuristics for one-dimensional bin-packing. Computers & Operations Research\u00a029, 821\u2013839 (2002)","journal-title":"Computers & Operations Research"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1287\/ijoc.8.4.428","volume":"8","author":"J. Korst","year":"1996","unstructured":"Korst, J., Aarts, E., Lenstra, J.K.: Scheduling periodic tasks. INFORMS Journal on Computing\u00a08, 428\u2013435 (1996)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/BFb0035103","volume-title":"PARLE \u201991. Parallel Architectures and Languages Europe","author":"J. Korst","year":"1991","unstructured":"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.\u00a0505, pp. 166\u2013178. Springer, Heidelberg (1991)"},{"key":"2_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models and Performance Analysis","author":"J.Y.-T. Leung","year":"2004","unstructured":"Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall\/CRC, Boca Raton (2004)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.cor.2006.10.021","volume":"35","author":"K.-H. Loh","year":"2008","unstructured":"Loh, K.-H., Golden, B., Wasil, E.: Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research\u00a035, 2283\u20132291 (2008)","journal-title":"Computers & Operations Research"},{"key":"2_CR12","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, revised edn. John Wiley & Sons, Chichester (November 1990)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A. Scholl","year":"1997","unstructured":"Scholl, A., Klein, R., J\u00fcrgens, C.: BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research\u00a024, 627\u2013645 (1997)","journal-title":"Computers & Operations Research"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics\u00a041, 579\u2013585 (1994)","journal-title":"Naval Research Logistics"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s101070050105","volume":"86","author":"F. Vanderbeck","year":"1999","unstructured":"Vanderbeck, F.: Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming\u00a086, 565\u2013594 (1999)","journal-title":"Mathematical Programming"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01300970","volume":"3","author":"P.H. Vance","year":"1994","unstructured":"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\u00a03, 111\u2013130 (1994)","journal-title":"Computational Optimization and Applications"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"J.M. Val\u00e9rio de Carvalho","year":"1999","unstructured":"Val\u00e9rio de Carvalho, J.M.: Exact solution of bin packing problems using column generation and branch and bound. Annals of Operations Research\u00a086, 629\u2013659 (1999)","journal-title":"Annals of Operations Research"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0167-6377(83)90044-5","volume":"2","author":"W.D. Wei","year":"1983","unstructured":"Wei, W.D., Liu, C.L.: On a periodic maintenance problem. Operations Research Letters\u00a02, 90\u201393 (1983)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T21:30:30Z","timestamp":1636320630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}