{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:46:28Z","timestamp":1740894388940,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407881"},{"type":"electronic","value":"9783540452096"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45209-6_30","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T21:03:29Z","timestamp":1294434209000},"page":"201-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recursive Refinement of Lower Bounds in the Multiprocessor Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]},{"given":"Masayuki","family":"Masukawa","sequence":"additional","affiliation":[]},{"given":"Shigeaki","family":"Tagashira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,6,1]]},"reference":[{"issue":"8","key":"30_CR1","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1109\/TC.1973.5009153","volume":"C-22","author":"E.B. Fernandez","year":"1973","unstructured":"Fernandez, E.B., Bussell, B.: Bounds on the number of processors and time for multiprocessor optimal schedules. IEEE Trans. Comput.\u00a0C-22(8), 745\u2013751 (1973)","journal-title":"IEEE Trans. Comput."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Fujita, S., Masukawa, M., Tagashira, S.: A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem. In: Proc. ICPADS 2002, pp. 611\u2013616 (2002)","DOI":"10.1109\/ICPADS.2002.1183469"},{"key":"30_CR3","unstructured":"http:\/\/www.kasahara.elec.waseda.ac.jp\/schedule\/index.hml"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2003 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45209-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:39:54Z","timestamp":1740839994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45209-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407881","9783540452096"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45209-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"1 June 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}