{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:09:24Z","timestamp":1772021364616,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0377-2217(97)00427-x","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"91-100","source":"Crossref","is-referenced-by-count":48,"title":["On the minimization of total weighted flow time with identical and uniform parallel machines"],"prefix":"10.1016","volume":"113","author":[{"given":"Meral","family":"Azizoglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Kirca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00427-X_BIB1","unstructured":"Azizoglu, M., Kirca, O., 1994. Scheduling jobs on unrelated parallel machines to minimize total cost functions, Technical report no. 94-17, Department of IE, Middle East Technical University, December 1994"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB2","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1002\/nav.3800200417","article-title":"Scheduling with parallel processors and linear delay costs","volume":"20","author":"Baker","year":"1973","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/05695557708975117","article-title":"An improved algorithm for scheduling jobs on identical machines","volume":"9","author":"Barnes","year":"1977","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB4","first-page":"382","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB5","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W., 1967. Theory of Scheduling. Addison-Wesley, Reading, MA"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB6","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","article-title":"Bounds for the optimal scheduling of n jobs on m processors","volume":"11","author":"Eastman","year":"1964","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/05695557408974926","article-title":"Scheduling jobs on a number of identical machines","volume":"6","author":"Elmaghraby","year":"1974","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB8","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1137\/0215081","article-title":"Worst case bound of an LRF schedule for the mean weighted flow time problem","volume":"15","author":"Kawaguchi","year":"1986","journal-title":"Siam Journal of Computing"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and scheduling problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(92)90035-2","article-title":"A new dynamic programming algorithm for the parallel machines total weighted completion time problem","volume":"11","author":"Lee","year":"1992","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB11","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","article-title":"Scheduling independent tasks on parallel processors","volume":"12","author":"Rothkopf","year":"1966","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB12","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/00207548808947934","article-title":"An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime","volume":"26","author":"Sarin","year":"1988","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00427-X_BIB13","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1287\/mnsc.38.1.124","article-title":"New bounds for the identical parallel processor weighted flow time problem","volume":"38","author":"Webster","year":"1991","journal-title":"Management Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700427X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700427X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T03:24:47Z","timestamp":1556162687000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179700427X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S037722179700427X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00427-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}