{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:45Z","timestamp":1740103845070,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T00:00:00Z","timestamp":1674604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T00:00:00Z","timestamp":1674604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2505\/19"],"award-info":[{"award-number":["2505\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10951-022-00772-4","type":"journal-article","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:03:20Z","timestamp":1674669800000},"page":"403-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence"],"prefix":"10.1007","volume":"26","author":[{"given":"Enrique","family":"Gerstl","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2824-8214","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"issue":"2","key":"772_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1080\/0305215X.2018.1458844","volume":"51","author":"RX Chen","year":"2019","unstructured":"Chen, R. X., Li, S. S., & Li, W. J. (2019). Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs. Engineering Optimization, 51(2), 217\u2013230.","journal-title":"Engineering Optimization"},{"issue":"4","key":"772_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10951-007-0030-z","volume":"10","author":"BC Choi","year":"2007","unstructured":"Choi, B. C., & Yoon, S. H. (2007). Maximizing the weighted number of just-in-time jobs in flow shop scheduling. Journal of Scheduling, 10(4), 237\u2013243.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"772_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10951-013-0320-6","volume":"16","author":"A Elalouf","year":"2013","unstructured":"Elalouf, A., Levner, E., & Tang, H. (2013). An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem. Journal of Scheduling, 16(4), 429\u2013435.","journal-title":"Journal of Scheduling"},{"key":"772_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0305-0548(90)90033-4","volume":"17","author":"T Fry","year":"1990","unstructured":"Fry, T., Armstrong, R. D., & Rosen, L. D. (1990). Single machine scheduling to minimize mean absolute lateness: A heuristic solution. Computers & Operations Research, 17, 105\u2013112.","journal-title":"Computers & Operations Research"},{"key":"772_CR6","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1080\/07408178708975418","volume":"19","author":"TD Fry","year":"1987","unstructured":"Fry, T. D., Armstrong, R. D., & Blackstone, J. H. (1987). Minimizing weighted absolute deviation in single machine scheduling. IIE Transactions, 19, 445\u2013450.","journal-title":"IIE Transactions"},{"key":"772_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ipl.2014.09.004","volume":"115","author":"E Gerstl","year":"2015","unstructured":"Gerstl, E., Mor, B., & Mosheiov, G. (2015). A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Information Processing Letters, 115, 159\u2013162.","journal-title":"Information Processing Letters"},{"issue":"3","key":"772_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10951-020-00638-7","volume":"23","author":"E Gerstl","year":"2020","unstructured":"Gerstl, E., & Mosheiov, G. (2020). Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. Journal of Scheduling, 23(3), 289\u2013299.","journal-title":"Journal of Scheduling"},{"key":"772_CR9","first-page":"1","volume":"72","author":"M Gilenson","year":"2019","unstructured":"Gilenson, M., & Shabtay, D. (2019). Multi-scenario scheduling to maximise the weighted number of just-in-time jobs. Journal of the Operational Research Society, 72, 1\u201318.","journal-title":"Journal of the Operational Research Society"},{"key":"772_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"7","key":"772_CR11","doi-asserted-by":"publisher","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 & Operations Research, 29(7), 841\u2013848.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"772_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10845-009-0285-7","volume":"22","author":"F Jolai","year":"2011","unstructured":"Jolai, F., Amalnick, M. S., Alinaghian, M., Shakhsi-Niaei, M., & Omrani, H. (2011). A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines. Journal of Intelligent Manufacturing, 22(2), 247\u2013261.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"772_CR100","doi-asserted-by":"crossref","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In Complexity of\ncomputer computations (pp. 85\u2013103). Boston, MA: Springer.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"772_CR13","doi-asserted-by":"publisher","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\/tardy jobs. Computers and Operations Research, 23, 769\u2013781.","journal-title":"Computers and Operations Research"},{"key":"772_CR14","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1016\/S0305-0548(01)00028-4","volume":"29","author":"CF Liaw","year":"2002","unstructured":"Liaw, C. F., Cheng, C. Y., & Chen, M. (2002). The total completion time open shop scheduling problem with a given sequence of jobs on one machine. Computers & Operations Research, 29, 1251\u20131266.","journal-title":"Computers & Operations Research"},{"key":"772_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10951-013-0327-z","volume":"16","author":"G Mosheiov","year":"2013","unstructured":"Mosheiov, G., & Shabtay, D. (2013). Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times. Journal of Scheduling, 16, 519\u2013527.","journal-title":"Journal of Scheduling"},{"key":"772_CR16","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ejor.2011.07.053","volume":"216","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D. (2012). The just-in-time scheduling problem in a flow-shop scheduling system. European Journal of Operational Research, 216, 521\u2013532.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"772_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10951-010-0204-y","volume":"15","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., & Bensoussan, Y. (2012). Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. Journal of Scheduling, 15(1), 39\u201347.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"772_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ijpe.2011.09.011","volume":"136","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., Bensoussan, Y., & Kaspi, M. (2012). A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system. International Journal of Production Economics, 136(1), 67\u201374.","journal-title":"International Journal of Production Economics"},{"key":"772_CR19","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F","volume":"45","author":"YM Shafransky","year":"1998","unstructured":"Shafransky, Y. M., & Strusevich, V. A. (1998). The open shop scheduling problem with a given sequence of jobs on one machine. Naval Research Logistics, 45, 705\u2013731.","journal-title":"Naval Research Logistics"},{"issue":"5","key":"772_CR20","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","volume":"8","author":"SC Sung","year":"2005","unstructured":"Sung, S. C., & Vlach, M. (2005). Maximizing weighted number of just-in-time jobs on unrelated parallel machines. Journal of Scheduling, 8(5), 453\u2013460.","journal-title":"Journal of Scheduling"},{"key":"772_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2015.09.010","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Cheng, S.-R., Cheng, T. C. E., Wang, D.-W., & Wu, C.-C. (2016). Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega, 63, 41\u201347.","journal-title":"Omega"},{"issue":"4","key":"772_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10951-017-0511-7","volume":"20","author":"Y Yin","year":"2017","unstructured":"Yin, Y., Cheng, T. C. E., Wang, D. J., & Wu, C. C. (2017). Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. Journal of Scheduling, 20(4), 313\u2013335.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00772-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00772-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00772-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T09:03:56Z","timestamp":1689671036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00772-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,25]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["772"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00772-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2023,1,25]]},"assertion":[{"value":"15 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}