{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T04:02:30Z","timestamp":1791172950842,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212997","type":"print"},{"value":"9783540247302","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24730-2_19","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:00:15Z","timestamp":1280746815000},"page":"220-235","source":"Crossref","is-referenced-by-count":27,"title":["Resource-Optimal Scheduling Using Priced Timed Automata"],"prefix":"10.1007","author":[{"given":"J. I.","family":"Rasmussen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Abdeddaim, Y., Kerbaa, A., Maler, O.: Task graph scheduling using timed automata. In: Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS (2003)","DOI":"10.1109\/IPDPS.2003.1213431"},{"key":"19_CR2","volume-title":"Network Flows - Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows - Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.: Automata for modelling real-time systems. In: Proc. of Int. Colloquium on Algorithms, Languages and Programming, July 1990, vol.\u00a0443, pp. 322\u2013335 (1990)","DOI":"10.1007\/BFb0032042"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2001","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, p. 49. Springer, Heidelberg (2001)"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/trsc.34.2.180.12302","volume":"34","author":"J.E. Beasley","year":"2000","unstructured":"Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., Abramson, D.: Scheduling aircraft landings - the static case. Transportation Science\u00a034(2), 180\u2013197 (2000)","journal-title":"Transportation Science"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Petterson, P., Romijn, J.: Efficient guiding towards cost-optimality in UPPAAL. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, p. 174. Springer, Heidelberg (2001)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J., Vaandrager, F.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, p. 147. Springer, Heidelberg (2001)"},{"key":"19_CR8","unstructured":"Berkelaar, M.: (October 2003), http:\/\/www.cs.sunysb.edu\/~algorith\/implement\/lpsolve\/implement.shtml"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0028779","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"1998","unstructured":"Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: A model-checking tool for real-time systems. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol.\u00a01427, pp. 546\u2013550. Springer, Heidelberg (1998)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01580379","volume":"11","author":"W.H. Cunningham","year":"1976","unstructured":"Cunningham, W.H.: A network simplex method. Mathematical Programming\u00a011, 105\u2013106 (1976)","journal-title":"Mathematical Programming"},{"key":"19_CR11","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Gruian, F., Kuchcinski, K.: Low-energy directed architecture selection and task scheduling. In: Proceedings of the 25th EuroMICRO Conference, vol.\u00a01, pp. 296\u2013302 (1999)","DOI":"10.1109\/EURMIC.1999.794484"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1006\/jpdc.1999.1578","volume":"59","author":"Y.-K. Kwok","year":"1999","unstructured":"Kwok, Y.-K., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing\u00a059(3), 381\u2013422 (1999)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Larsen, K., Larsson, F., Pettersson, P., Yi, W.: Efficient verification of real-time systems: Compact data structure and state space reduction. In: Proc. Real-Time Systems Symposium, pp. 14\u201324 (1997)","DOI":"10.1109\/REAL.1997.641265"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-44585-4_47","volume-title":"Computer Aided Verification","author":"K. Larsen","year":"2001","unstructured":"Larsen, K., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, p. 493. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. Journal on Software Tools for Technology Transfer\u00a01(1-2), 134\u2013152 (1997)","journal-title":"Int. Journal on Software Tools for Technology Transfer"},{"key":"19_CR17","unstructured":"L\u00f6bel, A.: (October 2003), http:\/\/www.zib.de\/Optimization\/Software\/Mcf\/"},{"key":"19_CR18","unstructured":"Rasmussen, J.I.: Priced timed automata and duality (2003), Available at http:\/\/www.cs.auc.dk\/~illum\/pubs\/ptaduality.html"},{"key":"19_CR19","unstructured":"Tobita, T., Kouda, M., Kasahara, H.: Performance evaluation of minimum execution time multiprocessor scheduling algorithms using standard task graph set. In: Proc. of PDPTA 2000, pp. 745\u2013751 (2000)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24730-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:18:53Z","timestamp":1559344733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24730-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212997","9783540247302"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24730-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}