{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T15:23:30Z","timestamp":1782746610507,"version":"3.54.5"},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1070\/20"],"award-info":[{"award-number":["1070\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013549","name":"Bundesministerium f\u00fcr Umwelt, Naturschutz, nukleare Sicherheit und Verbraucherschutz","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100021611","name":"Islamic Scholarship Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100021611","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejor.2026.02.017","type":"journal-article","created":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T16:13:39Z","timestamp":1771172019000},"page":"652-664","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Just-in-time scheduling in two-stage flexible flow shops"],"prefix":"10.1016","volume":"333","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8779-0890","authenticated-orcid":false,"given":"Klaus","family":"Heeger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6379-0383","authenticated-orcid":false,"given":"Danny","family":"Hermelin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5309-7075","authenticated-orcid":false,"given":"Yuval","family":"Itzhaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5750-2177","authenticated-orcid":false,"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2709-599X","authenticated-orcid":false,"given":"Dvir","family":"Shabtay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2026.02.017_bib0001","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/j.cor.2014.06.002","article-title":"Optimal interval scheduling with a resource constraint","volume":"51","author":"Angelelli","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.017_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","article-title":"Scheduling jobs with fixed start and end times","volume":"18","author":"Arkin","year":"1987","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.017_bib0003","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":"Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2026.02.017_bib0004","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s10951-014-0398-5","article-title":"Interval scheduling and colorful independent sets","volume":"18","author":"Bevernvan Bevern","year":"2015","journal-title":"Journal of Scheduling"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.017_bib0005","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00121680","article-title":"Interval scheduling on identical machines","volume":"9","author":"Bouzina","year":"1996","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.017_bib0006","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","article-title":"On the k-coloring of intervals","volume":"59","author":"Carlisle","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2026.02.017_bib0007","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10951-007-0030-z","article-title":"Maximizing the weighted number of just-in-time jobs in flow shop scheduling","volume":"10","author":"Choi","year":"2007","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2026.02.017_bib0008","series-title":"Parameterized complexity","author":"Downey","year":"1999"},{"issue":"4","key":"10.1016\/j.ejor.2026.02.017_bib0009","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10951-013-0320-6","article-title":"An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem","volume":"16","author":"Elalouf","year":"2013","journal-title":"Journal of Scheduling"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.017_bib0010","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/j.ejor.2026.02.017_bib0011","series-title":"Annals of discrete mathematics","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"vol. 5","author":"Graham","year":"1979"},{"key":"10.1016\/j.ejor.2026.02.017_bib0012","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2024.103533","article-title":"On the parameterized complexity of interval scheduling with eligible machine sets","volume":"144","author":"Hermelin","year":"2024","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.ejor.2026.02.017_bib0013","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1007\/s10951-019-00617-7","article-title":"On the parameterized tractability of the just-in-time flow-shop scheduling problem","volume":"22","author":"Hermelin","year":"2019","journal-title":"Journal of Scheduling"},{"issue":"7","key":"10.1016\/j.ejor.2026.02.017_bib0014","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/S0305-0548(00)00086-1","article-title":"Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs","volume":"29","author":"Hiraishi","year":"2002","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.017_bib0015","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and the sum of subset problems","volume":"126","author":"Ibarra","year":"1975","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.ejor.2026.02.017_bib0016","series-title":"Proc. of a symposium on the complexity of computer computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"8","key":"10.1016\/j.ejor.2026.02.017_bib0017","doi-asserted-by":"crossref","first-page":"769","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":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.02.017_bib0018","doi-asserted-by":"crossref","first-page":"67","DOI":"10.5267\/j.ijiec.2018.4.001","article-title":"A review of scheduling problem and resolution methods in flexible flow shop","volume":"10","author":"Lee","year":"2019","journal-title":"International Journal of Industrial Engineering Computations"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.017_bib0019","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"An n job, one machine sequencing algorithm for minimizing the number of late jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Management Science"},{"key":"10.1016\/j.ejor.2026.02.017_bib0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","article-title":"The hybrid flow shop scheduling problem","volume":"205","author":"Ruiz","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.017_bib0021","series-title":"Theory of linear and integer programming","author":"Schrijver","year":"1998"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.017_bib0022","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.ejor.2011.07.053","article-title":"The just-in-time scheduling problem in a flow-shop scheduling system","volume":"216","author":"Shabtay","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.017_bib0023","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10951-010-0204-y","article-title":"Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems","volume":"15","author":"Shabtay","year":"2012","journal-title":"Journal of Scheduling"},{"issue":"5","key":"10.1016\/j.ejor.2026.02.017_bib0024","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","article-title":"On the approximability of an interval scheduling problem","volume":"2","author":"Spieksma","year":"1999","journal-title":"Journal of Scheduling"},{"issue":"5","key":"10.1016\/j.ejor.2026.02.017_bib0025","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","article-title":"Maximizing weighted number of just-in-time jobs on unrelated parallel machines","volume":"8","author":"Sung","year":"2005","journal-title":"Journal of Scheduling"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.017_bib0026","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1504\/IJAOM.2020.108263","article-title":"A literature review on hybrid flow shop scheduling","volume":"12","author":"Tosun","year":"2020","journal-title":"International Journal of Advanced Operations Management"},{"key":"10.1016\/j.ejor.2026.02.017_bib0027","series-title":"Proc. of the 30th annual symposium on foundations of computer science (FOCS)","first-page":"332","article-title":"Speeding-up linear programming using fast matrix multiplication (extended abstract)","author":"Vaidya","year":"1989"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726001542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726001542?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T18:30:59Z","timestamp":1777660259000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726001542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0377221726001542"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.017","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Just-in-time scheduling in two-stage flexible flow shops","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.017","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}