{"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":1771189676670,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T00:00:00Z","timestamp":1186617600000},"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":[[2007,9,24]]},"DOI":"10.1007\/s10951-007-0030-z","type":"journal-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T15:56:55Z","timestamp":1186588615000},"page":"237-243","source":"Crossref","is-referenced-by-count":29,"title":["Maximizing the weighted number of just-in-time jobs in flow shop scheduling"],"prefix":"10.1007","volume":"10","author":[{"given":"Byung-Cheon","family":"Choi","sequence":"first","affiliation":[]},{"given":"Suk-Hun","family":"Yoon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,8,9]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1016\/S0305-0548(02)00114-4","volume":"30","author":"R. L. Bulfin","year":"2003","unstructured":"Bulfin, R. L., & M\u2019Hallah, R. (2003). Minimizing the weighted number of tardy jobs on a two-machine flow shop. Computers and Operations Research, 30, 1887\u20131900.","journal-title":"Computers and Operations Research"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1016\/j.cor.2004.05.011","volume":"32","author":"O. Cepek","year":"2005","unstructured":"Cepek, O., & Sung, S. C. (2005). A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers and Operations Research, 32, 3265\u20133271.","journal-title":"Computers and Operations Research"},{"key":"30_CR3","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"1996","unstructured":"Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1996). Introduction to algorithms. Cambridge: MIT Press."},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/nav.10056","volume":"50","author":"S. Dauzere-Peres","year":"2003","unstructured":"Dauzere-Peres, S., & Sevaux, M. (2003). Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Research Logistics, 50, 273\u2013288.","journal-title":"Naval Research Logistics"},{"key":"30_CR5","volume-title":"Computers and intractability, a\u00a0guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. & Johnson, D. S. (1979). Computers and intractability, a\u00a0guide to the theory of NP-completeness. New York: Freeman."},{"issue":"2","key":"30_CR6","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F. (1972). Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing, 1(2), 180\u2013187.","journal-title":"SIAM Journal on Computing"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A.\u00a0H.\u00a0G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"30_CR8","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., Levner, E., & Vlach, M. (2002). Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Computers and Operations Research, 29, 841\u2013848.","journal-title":"Computers and Operations Research"},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0167-6377(94)90041-8","volume":"16","author":"J. Jozefowska","year":"1994","unstructured":"Jozefowska, J., Jurisch, B., & Kubiak, W. (1994). Scheduling shops to minimize the weighted number of late jobs. Operations Research Letters, 16, 277\u2013283.","journal-title":"Operations Research Letters"},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In R.\u00a0E. Miller, & J.\u00a0W. Thatcher (Eds.), Complexity of computer computations (pp. 85\u2013103). New York: Plenum."},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A. Lann","year":"1996","unstructured":"Lann, A., & Mosheiov, G. (1996). Single machine scheduling to minimize the number of early and tardy jobs. Computers and Operations Research, 23, 769\u2013781.","journal-title":"Computers and Operations Research"},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0377-2217(02)00180-7","volume":"145","author":"R. M\u2019Hallah","year":"2003","unstructured":"M\u2019Hallah, R., & Bulfin, R. L. (2003). Minimizing the weighted number of tardy jobs on a single machine. European Journal of Operational Research, 145, 45\u201356.","journal-title":"European Journal of Operational Research"},{"key":"30_CR13","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.ejor.2003.06.027","volume":"160","author":"R. M\u2019Hallah","year":"2005","unstructured":"M\u2019Hallah, R., & Bulfin, R. L. (2005). Minimizing the weighted number of tardy jobs on parallel processors. European Journal of Operational Research, 160, 471\u2013484.","journal-title":"European Journal of Operational Research"},{"key":"30_CR14","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J. M. Moore","year":"1968","unstructured":"Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"30_CR15","volume-title":"Scheduling: theory, algorithm, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling: theory, algorithm, and systems. Upper Saddle River: Prentice Hall."},{"key":"30_CR16","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/S0377-2217(02)00827-5","volume":"151","author":"M. Sevaux","year":"2003","unstructured":"Sevaux, M., & Dauzere-Peres, S. (2003). Genetic algorithm to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research, 151, 296\u2013306.","journal-title":"European Journal of Operational Research"},{"key":"30_CR17","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"M. Akker van den","year":"2004","unstructured":"van den Akker, M., & Hoogeveen, H. (2004). Minimizing the number of tardy jobs. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton: Chapman and Hall\/CRC."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0030-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0030-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0030-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:40Z","timestamp":1559468380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0030-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,9]]},"references-count":17,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2007,9,24]]}},"alternative-id":["30"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0030-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,9]]}}}