{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T22:17:10Z","timestamp":1779920230271,"version":"3.53.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0305-0548(00)00086-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"841-848","source":"Crossref","is-referenced-by-count":50,"title":["Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs"],"prefix":"10.1016","volume":"29","author":[{"given":"Kunihiko","family":"Hiraishi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eugene","family":"Levner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milan","family":"Vlach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0305-0548(00)00086-1_BIB1","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimizing coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J Comput"},{"key":"10.1016\/S0305-0548(00)00086-1_BIB2","series-title":"Introduction to algorithms","author":"Cormen","year":"1996"},{"key":"10.1016\/S0305-0548(00)00086-1_BIB3","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/0305-0548(95)00078-X","article-title":"Single machine scheduling to minimize the number of early and tardy jobs","volume":"23","author":"Lann","year":"1996","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1016\/S0305-0548(00)00086-1_BIB4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: a review","volume":"38","author":"Baker","year":"1990","journal-title":"Oper Res"},{"key":"10.1016\/S0305-0548(00)00086-1_BIB5","series-title":"Network flows \u2014 theory, algorithms, and applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0305-0548(00)00086-1_BIB6","series-title":"Computers and intractability","author":"Garey","year":"1979"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000861?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000861?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T10:56:25Z","timestamp":1556448985000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":6,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0305054800000861"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00086-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}