{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T21:09:43Z","timestamp":1771189783473,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T00:00:00Z","timestamp":1565740800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T00:00:00Z","timestamp":1565740800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2016049"],"award-info":[{"award-number":["2016049"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10951-019-00617-7","type":"journal-article","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T21:29:15Z","timestamp":1565818155000},"page":"663-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On the parameterized tractability of the just-in-time flow-shop scheduling problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Danny","family":"Hermelin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dvir","family":"Shabtay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7916-0979","authenticated-orcid":false,"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"617_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"EM Arkin","year":"1987","unstructured":"Arkin, E. M., & Silverberg, E. L. (1987). Scheduling jobs with fixed start and finish times. Discrete Applied Mathematics, 18, 1\u20138.","journal-title":"Discrete Applied Mathematics"},{"key":"617_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"KR Baker","year":"1990","unstructured":"Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: A review. Operations Research, 38, 22\u201336.","journal-title":"Operations Research"},{"issue":"2","key":"617_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0167-6377(95)00031-9","volume":"18","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H. L., & Fellows, M. R. (1995). W[2]-hardness of precedence constrained $k$-processor scheduling. Operations Research Letters, 18(2), 93\u201397.","journal-title":"Operations Research Letters"},{"key":"617_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","volume":"59","author":"MC Carlisle","year":"1995","unstructured":"Carlisle, M. C., & Lloyd, E. L. (1995). On the $k$-coloring of intervals. Discrete Applied Mathematics, 59, 225\u2013235.","journal-title":"Discrete Applied Mathematics"},{"key":"617_CR5","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1016\/j.cor.2004.05.011","volume":"32","author":"O \u010cepek","year":"2005","unstructured":"\u010cepek, 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":"617_CR6","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. J. (2007). Maximizing the weighted number of just-in-time jobs in flow-shop scheduling. Journal of Scheduling, 10, 237\u2013243.","journal-title":"Journal of Scheduling"},{"key":"617_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F. V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., et al. (2015). Parameterized algorithms. New York: Springer."},{"key":"617_CR8","doi-asserted-by":"crossref","unstructured":"Downey, R.G., & Fellows, M.R. (1992). Fixed-parameter intractability. In Proceedings of the 7th annual structure in complexity theory conference (COCO \u201992) (pp. 36\u201349).","DOI":"10.1109\/SCT.1992.215379"},{"key":"617_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R. G., & Fellows, M. R. (2013). Fundamentals of parameterized complexity. New York: Springer."},{"issue":"4","key":"617_CR10","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"},{"issue":"2","key":"617_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0304-3975(02)00811-3","volume":"298","author":"MR Fellows","year":"2003","unstructured":"Fellows, M. R., & McCartin, C. (2003). On the parametric complexity of schedules to minimize tardy tasks. Theoretical Computer Science, 298(2), 317\u2013324.","journal-title":"Theoretical Computer Science"},{"key":"617_CR12","volume-title":"Parameterized complexity theory","author":"J Flum","year":"1998","unstructured":"Flum, J., & Grohe, M. (1998). Parameterized complexity theory. New York: Springer."},{"key":"617_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0272-6963(00)00051-6","volume":"29","author":"RR Fullerton","year":"2001","unstructured":"Fullerton, R. R., & McWatters, C. S. (2001). The production performance benefits from JIT implementation. Journal of Operations Management, 29, 81\u201396.","journal-title":"Journal of Operations Management"},{"key":"617_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"3","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 3, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"617_CR15","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., & Karp, R. M. (1962). A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics, 10(1), 196\u2013210.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"617_CR16","unstructured":"Hermelin, D., Kubitza, J.M., Shabtay, D., Talmon, N., & Woeginger, G. (2015). Scheduling two competing agents when one agent has significantly fewer jobs. In Proceedings of the 10th international symposium on parameterized and exact computation (IPEC \u201915)."},{"key":"617_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"MY Kovalyov","year":"2007","unstructured":"Kovalyov, M. Y., Ng, C. T., & Cheng, T. C. E. (2007). Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research, 178, 331\u2013342.","journal-title":"European Journal of Operational Research"},{"key":"617_CR18","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"AY Lann","year":"1996","unstructured":"Lann, A. Y., & 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":"617_CR19","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.cor.2018.07.020","volume":"100","author":"M Mnich","year":"2018","unstructured":"Mnich, M., & van Bevern, R. (2018). Parameterized complexity of machine scheduling: 15 open problems. Computers and Operations Research, 100, 254\u2013261.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"617_CR20","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-014-0830-9","volume":"154","author":"M Mnich","year":"2015","unstructured":"Mnich, M., & Wiese, A. (2015). Scheduling meets fixed-parameter tractability. Mathematical Programming, 154(1), 533\u2013562.","journal-title":"Mathematical Programming"},{"key":"617_CR21","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R. (2006). Invitation to Fixed-Parameter Algorithms. Oxford: Oxford Univerity Press."},{"issue":"3","key":"617_CR22","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(3), 521\u2013532.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"617_CR23","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"},{"key":"617_CR24","volume-title":"Just-In-Time systems","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., & Steiner, G. (2012). Scheduling to maximize the number of just-in-time jobs: A survey. In R. Z. Rios-Mercado & Y. A. Rios-Solis (Eds.), Just-In-Time systems. New York: Springer."},{"issue":"5","key":"617_CR25","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10951-014-0398-5","volume":"18","author":"R van Bevern","year":"2015","unstructured":"van Bevern, R., Mnich, M., Niedermeier, R., & Weller, M. (2015). Interval scheduling and colorful independent sets. Journal of Scheduling, 18(5), 449\u2013469.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"617_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10951-016-0478-9","volume":"20","author":"R van Bevern","year":"2016","unstructured":"van Bevern, R., Niedermeier, R., & Such\u00fd, O. (2016). A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. Journal of Scheduling, 20(3), 255\u2013264.","journal-title":"Journal of Scheduling"},{"key":"617_CR27","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0305-0483(00)00033-5","volume":"29","author":"RE White","year":"2001","unstructured":"White, R. E., & Prybutok, V. (2001). The relationship between JIT practices and type of production system. Omega, 29, 113\u2013124.","journal-title":"Omega"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00617-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-019-00617-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00617-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T23:14:31Z","timestamp":1597274071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-019-00617-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,14]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["617"],"URL":"https:\/\/doi.org\/10.1007\/s10951-019-00617-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,14]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}