{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:39:22Z","timestamp":1725496762518},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653851"},{"type":"electronic","value":"9783540493815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49381-6_14","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:47:50Z","timestamp":1196646470000},"page":"119-129","source":"Crossref","is-referenced-by-count":3,"title":["On-Line Scheduling of Parallel Jobs with Runtime Restrictions"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Bischof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst W.","family":"Mayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"key":"14_CR1","series-title":"SFB","volume-title":"SFB-Bericht 342\/04\/98 A","author":"S. Bischof","year":"1998","unstructured":"Stefan Bischof and Ernst W. Mayr. On-Line Scheduling of Parallel Jobs with Runtime Restrictions. SFB-Bericht 342\/04\/98 A, SFB 342, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, April 1998. \n                    http:\/\/www.mayr.in.tum.de\/berichte\/1998\/TUM-I9810.ps.gz\n                    \n                  ."},{"key":"14_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling Com-puter and Manufacturing Processes","author":"J. B\u0142a\u017cewicz","year":"1996","unstructured":"J. B\u0142a\u017cewicz, K.H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz. Scheduling Com-puter and Manufacturing Processes Springer Verlag, Berlin, 1996."},{"key":"14_CR3","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"E.G. Coffman Jr.","year":"1996","unstructured":"E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson. Approximation Algorithms for Bin Packing: A Survey. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems chapter 2, pages 46\u201393. PWS Publishing Company, Boston, 1996."},{"key":"14_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60153-8","volume-title":"Job Scheduling Strategies for Parallel Processing (IPPS\u2019 95 Workshop)","author":"D. G. Feitelson","year":"1995","unstructured":"Dror G. Feitelson and Larry Rudolph. Parallel Job Scheduling: Issues and Approaches. In Dror G. Feitelson and Larry Rudolph, editors, Job Scheduling Strategies for Parallel Processing (IPPS\u2019 95 Workshop) LNCS 949, pages 1\u201318, Berlin, 1995. Springer-Verlag."},{"key":"14_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-63574-2","volume-title":"Job Scheduling Strategies for Parallel Processing (IPPS\u2019 97 Workshop)","author":"D. G. Feitelson","year":"1997","unstructured":"Dro G. Feitelson, Larry Rudolph, Uwe Schwiegelshohn, Kenneth C. Sevcik, and Parkson Wong. Theory and Practice in Parallel Job Scheduling. In Dror G. Feitelson and Larry Rudolph, editors, Job Scheduling Strategies for Parallel Processing (IPPS\u2019 97 Workshop)LNCS 1291, pages 1\u201334, Berlin, 1997. Springer-Verlag."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Anja Feldmann, Ming-Yang Kao, Ji\u0159\u00ed Sgall, and Shang-Hua Teng. Optimal Online Scheduling of Parallel Jobs with Dependencies. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing pages 642\u2013651, New York, 1993.","DOI":"10.1145\/167088.167254"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(94)90152-X","volume":"130","author":"A. Feldmann","year":"1994","unstructured":"Anja Feldmann, Ji\u0159\u00ed Sgall, and Shang-Hua Teng. Dynamic scheduling on parallel machines. Theoretical Computer Science, Special Issue on Dynamic and On-line Algorithms 130(1):49\u201372, 1994.","journal-title":"Theoretical Computer Science"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, R.L. Graham, D.S. Johnson, and A.C.-C. Yao. Resource Constrained Scheduling as Generalized Bin Packing. J. Comb. Theory Series A 21:257\u2013298, 1976.","journal-title":"J. Comb. Theory Series A"},{"key":"14_CR9","series-title":"PhD thesis","volume-title":"On-Line Scheduling on Parallel Machines","author":"J. Sgall","year":"1994","unstructured":"Ji\u0159\u00ed Sgall. On-Line Scheduling on Parallel Machines. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, 1994."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49381-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:40:49Z","timestamp":1551141649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49381-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653851","9783540493815"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-49381-6_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}