{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:08:37Z","timestamp":1725905317029},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557014"},{"type":"electronic","value":"9783319557021"}],"license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-55702-1_62","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T10:21:16Z","timestamp":1500546076000},"page":"467-473","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling on Uniform Nonsimultaneous Parallel Machines"],"prefix":"10.1007","author":[{"given":"Liliana","family":"Grigoriu","sequence":"first","affiliation":[]},{"given":"Donald K.","family":"Friesen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"issue":"1","key":"62_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman Jr","year":"1978","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: An application of Bin-Packing to multiprocessor scheduling. SIAM J. Comput. 7(1), 1\u201317 (1978)","journal-title":"SIAM J. Comput."},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Lee, C.Y.: Parallel Machine Scheduling with nonsimultaneous machine available time. Discrete Appl. Math. 30(1), 53\u201361 (1991)","DOI":"10.1016\/0166-218X(91)90013-M"},{"key":"62_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(99)00049-9","volume":"92","author":"SY Chang","year":"1999","unstructured":"Chang, S.Y., Hwang, H.: The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines. Discrete Appl. Math. 92, 135\u2013147 (1999)","journal-title":"Discrete Appl. Math."},{"key":"62_CR4","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.dam.2013.10.022","volume":"167","author":"HC Hwang","year":"2014","unstructured":"Hwang, H.C., Lim, K.: Discrete Appl. Math. 167, 172\u2013187 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"62_CR5","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/0212004","volume":"12","author":"DK Friesen","year":"1983","unstructured":"Friesen, D.K., Langston, M.A.: Bounds for multifit scheduling on uniform processors. SIAM J. Comput. 12(1), 60\u201369 (1983)","journal-title":"SIAM J. Comput."},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Chen, B.: Tighter bound for MULTIFIT scheduling on uniform processors. Discrete Appl. Math. 31(3), 227\u2013260 (1991)","DOI":"10.1016\/0166-218X(91)90053-Y"},{"issue":"3","key":"62_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF02684354","volume":"61","author":"RE Burkard","year":"1998","unstructured":"Burkard, R.E., He, Y.: A note on MULTIFIT scheduling for uniform machines. Computing 61(3), 277\u2013283 (1998)","journal-title":"Computing"},{"key":"62_CR8","unstructured":"He, Y.: Uniform machine scheduling with machine available constraints. Acta Math. Appl. Sin. (English Series), 16(2), 122\u2013129 (2000)"},{"key":"62_CR9","doi-asserted-by":"publisher","unstructured":"Grigoriu, L., Friesen, D.K.: Approximation for scheduling on uniform nonsimultaneous parallel machines. J. Sched. (2016). doi:\n10.1007\/s10951-016-0501-1","DOI":"10.1007\/s10951-016-0501-1"},{"key":"62_CR10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.disopt.2014.10.001","volume":"17","author":"L Grigoriu","year":"2015","unstructured":"Grigoriu, L., Friesen, D.K.: Scheduling on uniform processors with at most one downtime on each machine. Discrete Optim. 17, 14\u201324 (2015)","journal-title":"Discrete Optim."},{"key":"62_CR11","unstructured":"Grigoriu, L.: Scheduling on parallel machines with variable availability patterns. Ph.D. thesis, Politehnica University Bucharest (2012)"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55702-1_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T10:35:47Z","timestamp":1500546947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55702-1_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,21]]},"ISBN":["9783319557014","9783319557021"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55702-1_62","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017,7,21]]}}}