{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T17:31:56Z","timestamp":1780075916952,"version":"3.54.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T00:00:00Z","timestamp":1525824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10951-018-0562-4","type":"journal-article","created":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T16:14:53Z","timestamp":1525882493000},"page":"59-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths"],"prefix":"10.1007","volume":"22","author":[{"given":"J.-C.","family":"Billaut","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2897-183X","authenticated-orcid":false,"given":"F.","family":"Della Croce","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F.","family":"Salassa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.","family":"T\u2019kindt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,9]]},"reference":[{"key":"562_CR1","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/nav.3800290311","volume":"29","author":"I Adiri","year":"1982","unstructured":"Adiri, I., & Pohoryles, D. (1982). Flowshop\/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics, 29, 495\u2013504.","journal-title":"Naval Research Logistics"},{"key":"562_CR2","doi-asserted-by":"crossref","unstructured":"Agnetis, A., Nicol\u00f2, F., & Lucertini, M. (1989). Just-in-time scheduling in a pipeline manufacturing system. In Proceedings of the IFAC\/CIRP\/IFIP\/IFORS Workshop on Decisional Structures in Automated Manufacturing (pp. 81\u201387).","DOI":"10.1016\/S1474-6670(17)54330-X"},{"key":"562_CR3","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.ejor.2016.05.036","volume":"255","author":"A Allahverdi","year":"2016","unstructured":"Allahverdi, A. (2016). A survey of scheduling problems with no-wait in process. European Journal of Operational Research, 255, 665\u2013686.","journal-title":"European Journal of Operational Research"},{"key":"562_CR4","first-page":"429","volume":"1","author":"P Baptiste","year":"1997","unstructured":"Baptiste, P., & Lee, K. H. (1997). A branch and bound algorithm for the $$F | no-idle | C_{\\max }$$ F | n o - i d l e | C max . Proceedings of the International Conference on Industrial Engineering and Production Management, 1, 429\u2013438.","journal-title":"Proceedings of the International Conference on Industrial Engineering and Production Management"},{"key":"562_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10288-014-0257-4","volume":"12","author":"P Chr\u00e9tienne","year":"2014","unstructured":"Chr\u00e9tienne, P. (2014). On scheduling with the non-idling constraint. 4OR, 12, 101\u2013121.","journal-title":"4OR"},{"key":"562_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E. D., Ma, F., & Waingarten, E. (2014) Playing dominoes is hard, except by yourself. In FUN 2014, LNCS (Vol. 8496, pp. 137\u2013146).","DOI":"10.1007\/978-3-319-07890-8_12"},{"key":"562_CR7","unstructured":"Fleischner, H. (1991). Eulerian graphs and related topics. In: H. Fleischner (Ed.), Annals of discrete mathematics, part 1 (Vol. 50). North-Holland: Elsevier."},{"key":"562_CR8","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1982","unstructured":"Garey, M. R., & Johnson, D. S. (1982). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman and CO."},{"key":"562_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"562_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/S0377-2217(00)00022-9","volume":"130","author":"K Giaro","year":"2001","unstructured":"Giaro, K. (2001). NP-hardness of compact scheduling in simplified open and flow shops. European Journal of Operational Research, 130, 90\u201398.","journal-title":"European Journal of Operational Research"},{"key":"562_CR11","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"PC Gilmore","year":"1964","unstructured":"Gilmore, P. C., & Gomory, R. E. (1964). Sequencing a one state variable machine: A solvable case of the traveling salesman problem. Operations Research, 12, 655\u2013679.","journal-title":"Operations Research"},{"key":"562_CR12","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.ejor.2008.03.039","volume":"196","author":"Y Goncharov","year":"2009","unstructured":"Goncharov, Y., & Sevastyanov, S. (2009). The flow shop problem with no-idle constraints: A review and approximation. European Journal of Operational Research, 196, 450\u2013456.","journal-title":"European Journal of Operational Research"},{"key":"562_CR13","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510\u2013525.","journal-title":"Operations Research"},{"key":"562_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10951-011-0241-1","volume":"15","author":"W H\u00f6hn","year":"2012","unstructured":"H\u00f6hn, W., Jacobs, T., & Megow, N. (2012). On Eulerian extensions and their application to no-wait flowshop scheduling. Journal of Scheduling, 15, 295\u2013309.","journal-title":"Journal of Scheduling"},{"key":"562_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"562_CR16","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ejor.2006.01.036","volume":"178","author":"PJ Kalczynski","year":"2007","unstructured":"Kalczynski, P. J., & Kamburowski, J. (2007). On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research, 178, 677\u2013685.","journal-title":"European Journal of Operational Research"},{"key":"562_CR17","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Handbooks in operations research and management science, vol 4: Logistics of production and inventory","author":"EL Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan, & P. Zipkin (Eds.), Handbooks in operations research and management science, vol 4: Logistics of production and inventory (pp. 445\u2013522). Amsterdam: North-Holland."},{"key":"562_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1057\/jors.1972.52","volume":"23","author":"SS Reddi","year":"1972","unstructured":"Reddi, S. S., & Ramamoorthy, C. V. (1972). On the flowshop sequencing problem with no-wait in process. Operational Research Quarterly, 23, 323\u2013331.","journal-title":"Operational Research Quarterly"},{"key":"562_CR19","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/62.65","volume":"31","author":"H R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H. (1984). The three machine no-wait flowshop problem is NP-complete. Journal of the Association for Computing Machinery, 31, 336\u2013345.","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0562-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0562-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0562-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T00:11:36Z","timestamp":1661213496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0562-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,9]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["562"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0562-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,9]]},"assertion":[{"value":"9 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}