{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T21:07:56Z","timestamp":1771189676780,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s10951-005-2863-7","type":"journal-article","created":{"date-parts":[[2005,7,29]],"date-time":"2005-07-29T05:57:11Z","timestamp":1122616631000},"page":"453-460","source":"Crossref","is-referenced-by-count":33,"title":["Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines"],"prefix":"10.1007","volume":"8","author":[{"given":"Shao Chin","family":"Sung","sequence":"first","affiliation":[]},{"given":"Milan","family":"Vlach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2863_CR1","doi-asserted-by":"crossref","unstructured":"\u010cepek, O. and S. C. Sung, \u201cA quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines,\u201d accepted by Computers & Operations Research, 2004.","DOI":"10.1016\/j.cor.2004.05.011"},{"key":"2863_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979."},{"issue":"2","key":"2863_CR3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F., \u201cAlgorithms for minimizing coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph,\u201d SIAM Journal on Computing, 1(2), 180\u2013187 (1972).","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"2863_CR4","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/S0305-0548(00)00086-1","volume":"29","author":"K. Hiraishi","year":"2002","unstructured":"Hiraishi, K., E. Levner, and M. Vlach, \u201cScheduling of parallel identical machines to maximize the weighted number of just-in-time jobs,\u201d Computers & Operations Research, 29(7), 841\u2013848 (2002).","journal-title":"Computers & Operations Research"},{"key":"2863_CR5","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A. Lann","year":"1996","unstructured":"Lann, A. and G. Mosheiov, \u201cSingle machine scheduling to minimize the number of early and tardy jobs,\u201d Computers & Operations Research 23, 765\u2013781 (1996).","journal-title":"Computers & Operations Research"},{"key":"2863_CR6","doi-asserted-by":"crossref","unstructured":"Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, \u201cSequencing and scheduling, Algorithms and complexity,\u201d in S. C. Graves, A. H. G. Rinnooy Kan and P. H. Zipkin (eds.), Handbooks in Operations Research and Management Science, Vol. 4, Amsterdam, 1993, pp. 455\u2013522.","DOI":"10.1016\/S0927-0507(05)80189-6"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-2863-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-005-2863-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-2863-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T11:57:16Z","timestamp":1586347036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-005-2863-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["2863"],"URL":"https:\/\/doi.org\/10.1007\/s10951-005-2863-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}