{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:18Z","timestamp":1759847298969},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T00:00:00Z","timestamp":1129766400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s00186-005-0009-5","type":"journal-article","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T12:10:47Z","timestamp":1129723847000},"page":"275-279","source":"Crossref","is-referenced-by-count":4,"title":["Minimizing total completion time for UET tasks with release time and outtree precedence constraints"],"prefix":"10.1007","volume":"62","author":[{"given":"Yumei","family":"Huo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph Y. -T.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,20]]},"reference":[{"key":"9_CR1","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1974","unstructured":"Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison Wesley, Reading"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s001860200228","volume":"56","author":"P Brucker","year":"2003","unstructured":"Brucker P, Hurink J, Knust S. (2003). A polynomial algorithm for $$P \\mid p_{j} = 1, r_{j}$$ , outtree $$\\mid \\sum C_{j}$$ and $$P \\mid pmtn, p_{j} = 1, r_{j}$$ , outtree $$\\mid \\sum C_{j}$$ . Math Methods Oper Res 56:407\u2013412","journal-title":"Math Methods Oper Res"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman Jr","year":"1972","unstructured":"Coffman EG Jr, Graham RL (1972) Optimal scheduling for two-processor systems. Acta Inform 1:200\u2013213","journal-title":"Acta Inform"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s00236-003-0119-6","volume":"39","author":"EG Coffman Jr","year":"2003","unstructured":"Coffman EG Jr, Sethuraman J, Timkovsky VG (2003) Ideal preemptive schedules on two processors. Acta Inform 39:597\u2013612","journal-title":"Acta Inform"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Huo Y, Leung JY-T (2005) Minimizing mean flow time for UET tasks, \u201cweb.njit.edu\/\u223cleung\/mft-uet\/paper.ps\u201d","DOI":"10.1145\/1150334.1150340"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-005-0009-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-005-0009-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-005-0009-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T10:44:05Z","timestamp":1586515445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-005-0009-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,20]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["9"],"URL":"https:\/\/doi.org\/10.1007\/s00186-005-0009-5","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,20]]}}}