{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:02Z","timestamp":1759847222945},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,10,12]],"date-time":"2006-10-12T00:00:00Z","timestamp":1160611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2006,11,15]]},"DOI":"10.1007\/s10878-006-9011-y","type":"journal-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T13:30:00Z","timestamp":1160573400000},"page":"33-45","source":"Crossref","is-referenced-by-count":10,"title":["A simple linear time approximation algorithm for multi-processor job scheduling on four processors"],"prefix":"10.1007","volume":"13","author":[{"given":"Jingui","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songqiao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,12]]},"reference":[{"key":"9011_CR1","doi-asserted-by":"crossref","unstructured":"Amoura AK, Bampis E, Kenyon C, Manoussakis Y (2002) Scheduling independent multiprocessor tasks. Algorithmica 32:247\u2013261","DOI":"10.1007\/s00453-001-0076-9"},{"key":"9011_CR2","doi-asserted-by":"crossref","unstructured":"Bianco L, Blazewicz J, Dell\u2019Olmo P, Drozdowski M (1995) Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors. Ann Oper Res 58:493\u2013517","DOI":"10.1007\/BF02057160"},{"key":"9011_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(92)90172-R","volume":"41","author":"J Blazewicz","year":"1992","unstructured":"Blazewicz J, Dell\u2019Olmo P, Drozdowski M, Speranza M (1992) Scheduling multiprocessor tasks on the three dedicated processors. Inf Proc Lett 41:275\u2013280","journal-title":"Inf Proc Lett"},{"key":"9011_CR5","doi-asserted-by":"crossref","unstructured":"Blazewicz J, Dell\u2019Olmo P, Drozdowski M, Speranza M (1992\/1994) Corrigendum to Scheduling multiprocessor tasks on the three dedicated processors. Inf Proc Lett 41:275\u2013280. Inf Proc Lett 49:269\u2013270","DOI":"10.1016\/0020-0190(94)90066-3"},{"key":"9011_CR6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","volume":"35","author":"J Blazewicz","year":"1986","unstructured":"Blazewicz J, Drozdowski M, Weglarz J (1986) Scheduling multiprocessor tasks to minimize scheduling length. IEEE Trans Comput 35:389\u2013393","journal-title":"IEEE Trans Comput"},{"key":"9011_CR7","first-page":"89","volume":"13","author":"J Blazewicz","year":"1994","unstructured":"Blazewicz J, Drozdowski W, Weglarz J (1994) Scheduling multiprocessor tasks\u2014a survey. Int J Microcomput Appl 13:89\u201397","journal-title":"Int J Microcomput Appl"},{"key":"9011_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H","volume":"46","author":"J Chen","year":"1999","unstructured":"Chen J, Lee C-Y (1999) General multiprocessor tasks scheduling. Naval Res Log 46:59\u201374","journal-title":"Naval Res Log"},{"key":"9011_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539798348110","volume":"31","author":"J Chen","year":"2001","unstructured":"Chen J, Miranda A (2001) A polynomial time approximation scheme for general multiprocessor job scheduling. SIAM J Comput 31:1\u201317","journal-title":"SIAM J Comput"},{"key":"9011_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(97)84781-4","volume":"164","author":"P Dell'Olmo","year":"1997","unstructured":"Dell\u2019Olmo P, Speranza MG, Tuza Zs (1997) Efficiency and effectiveness of normal schedules on three dedicated processors. Discrete Math 164:67\u201379","journal-title":"Discrete Math"},{"key":"9011_CR11","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1287\/opre.37.4.592","volume":"37","author":"G Dobson","year":"1989","unstructured":"Dobson G, Karmarkar U (1989) Simultaneous resource scheduling to minimize weighted flow times. Oper Res 37:592\u2013600","journal-title":"Oper Res"},{"key":"9011_CR12","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9011_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0166-218X(94)00160-F","volume":"61","author":"MX Goemans","year":"1995","unstructured":"Goemans MX (1995) An approximation algorithm for scheduling on three dedicated machines. Discrete Appl Math 61:49\u201359","journal-title":"Discrete Appl Math"},{"key":"9011_CR14","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Sys Tech J 45:1563\u20131581","journal-title":"Bell Sys Tech J"},{"key":"9011_CR15","unstructured":"Hall LA (1997) Approximation algorithms for scheduling. In: Hochbaum DS, (ed.) Approximation algorithms for NP-hard problems. PWS Publishing Company, pp 1\u201345"},{"key":"9011_CR16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"JA Hoogeveen","year":"1994","unstructured":"Hoogeveen JA, van de Velde SL, Veltman B (1994) Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl Math 55:259\u2013272","journal-title":"Discrete Appl Math"},{"key":"9011_CR17","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1137\/S0097539799361737","volume":"35","author":"K Jansen","year":"2005","unstructured":"Jansen K, Porkolab L (2005) General multiprocessor task scheduling: approximate solutions in linear time. SIAM J Comput 35:519\u2013530","journal-title":"SIAM J Comput"},{"key":"9011_CR18","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TC.1985.1676647","volume":"34","author":"H Krawczyk","year":"1985","unstructured":"Krawczyk H, Kubale M (1985) An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans Comput 34:869\u2013872","journal-title":"IEEE Trans Comput"},{"key":"9011_CR19","first-page":"445","volume":"31","author":"C-Y Lee","year":"1999","unstructured":"Lee C-Y, Cai X (1999) Scheduling one and two-processor tasks on two parallel processors. IIE Trans 31:445\u2013455","journal-title":"IIE Trans"},{"key":"9011_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018909801944","volume":"70","author":"C-Y Lee","year":"1997","unstructured":"Lee C-Y, Lei L, Pinedo M (1997) Current trends in deterministic scheduling. Ann Ope Res 70:1\u201342","journal-title":"Ann Ope Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9011-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9011-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9011-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:10Z","timestamp":1559261890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9011-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,11,15]]}},"alternative-id":["9011"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9011-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,12]]}}}