{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:07:19Z","timestamp":1771700839163,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T00:00:00Z","timestamp":1478822400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"POSDRU","award":["POSDRU\/88\/1.5\/S\/60203"],"award-info":[{"award-number":["POSDRU\/88\/1.5\/S\/60203"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10951-016-0501-1","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T15:13:40Z","timestamp":1478877220000},"page":"593-600","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximation for scheduling on uniform nonsimultaneous parallel machines"],"prefix":"10.1007","volume":"20","author":[{"given":"Liliana","family":"Grigoriu","sequence":"first","affiliation":[]},{"given":"Donald K.","family":"Friesen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"key":"501_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF02684354","volume":"61","author":"RE Burkard","year":"1998","unstructured":"Burkard, R. E., & He, Y. (1998). A note on MULTIFIT scheduling for uniform machines. Computing, 61, 277\u2013283.","journal-title":"Computing"},{"key":"501_CR2","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.-C. (1999). The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines. Discrete Applied Mathematics, 92, 135\u2013147.","journal-title":"Discrete Applied Mathematics"},{"key":"501_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0166-218X(91)90053-Y","volume":"31","author":"B Chen","year":"1991","unstructured":"Chen, B. (1991). Tighter bound for MULTIFIT scheduling on uniform processors. Discrete Applied Mathematics, 31, 227\u2013260.","journal-title":"Discrete Applied Mathematics"},{"key":"501_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman Jr","year":"1978","unstructured":"Coffman, E. G, Jr., Garey, M. R., & Johnson, D. S. (1978). An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing, 7, 1\u201317.","journal-title":"SIAM Journal on Computing"},{"key":"501_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. (1983). Bounds for MULTIFIT scheduling on uniform processors. SIAM Journal on Computing, 12, 60\u201369.","journal-title":"SIAM Journal on Computing"},{"key":"501_CR6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17, 416\u2013429.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"501_CR7","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.disopt.2010.04.003","volume":"7","author":"L Grigoriu","year":"2010","unstructured":"Grigoriu, L., & Friesen, D. K. (2010). Scheduling on same-speed processors with at most one downtime on each machine. Discrete Optimization, 7, 212\u2013221.","journal-title":"Discrete Optimization"},{"key":"501_CR8","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. (2015). Scheduling on uniform processors with at most one downtime on each machine. Discrete Optimization, 17, 14\u201324.","journal-title":"Discrete Optimization"},{"key":"501_CR9","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/BF02677672","volume":"16","author":"Y He","year":"2000","unstructured":"He, Y. (2000). Uniform machine scheduling with machine available constraints. Acta Mathematicae Applicatae Sinica (English Series), 16, 122\u2013129.","journal-title":"Acta Mathematicae Applicatae Sinica (English Series)"},{"key":"501_CR10","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. (2014). Exact performance of MULTIFIT for nonsimultaneous machines. Discrete Applied Mathematics, 167, 172\u2013187.","journal-title":"Discrete Applied Mathematics"},{"key":"501_CR11","first-page":"991","volume":"30","author":"H Kellerer","year":"1998","unstructured":"Kellerer, H. (1998). Algorithms for multiprocessor scheduling with machine release times. IIE Transactions, 30, 991\u2013999.","journal-title":"IIE Transactions"},{"key":"501_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","volume":"30","author":"CY Lee","year":"1991","unstructured":"Lee, C. Y. (1991). Parallel machine scheduling with nonsimultaneous machine available time. Discrete Applied Mathematics, 30, 53\u201361.","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"501_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<267::AID-JOS31>3.0.CO;2-H","volume":"2","author":"M Scharbrodt","year":"1999","unstructured":"Scharbrodt, M., Steger, A., & Weisser, H. (1999). Approximability of scheduling with fixed jobs. Journal of Scheduling, 2(6), 267\u2013284.","journal-title":"Journal of Scheduling"},{"key":"501_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02216826","volume":"24","author":"M Yue","year":"1990","unstructured":"Yue, M. (1990). On the exact upper bound of the MULTIFIT processor scheduling algorithm. Annals of Operations Research, 24, 233\u2013259.","journal-title":"Annals of Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0501-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0501-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0501-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T09:30:10Z","timestamp":1511256610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0501-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,11]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["501"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0501-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,11]]}}}