{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:11:10Z","timestamp":1761621070312},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T00:00:00Z","timestamp":1310515200000},"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":[[2012,6]]},"DOI":"10.1007\/s10951-011-0241-1","type":"journal-article","created":{"date-parts":[[2011,7,12]],"date-time":"2011-07-12T11:13:28Z","timestamp":1310469208000},"page":"295-309","source":"Crossref","is-referenced-by-count":21,"title":["On Eulerian extensions and their application to no-wait flowshop scheduling"],"prefix":"10.1007","volume":"15","author":[{"given":"Wiebke","family":"H\u00f6hn","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Jacobs","sequence":"additional","affiliation":[]},{"given":"Nicole","family":"Megow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,13]]},"reference":[{"issue":"2","key":"241_CR1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/opre.36.2.192","volume":"36","author":"M. O. Ball","year":"1988","unstructured":"Ball, M. O., & Magazine, M. J. (1988). Sequencing of insertions in printed circuit board assembly. Operations Research, 36(2), 192\u2013201.","journal-title":"Operations Research"},{"key":"241_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-27821-4_6","volume-title":"Proceedings of the 7th international workshop on approximation algorithms for combinatorial optimization problems (APPROX)","author":"M. Bl\u00e4ser","year":"2004","unstructured":"Bl\u00e4ser, M. (2004). A 3\/4-approximation algorithm for maximum asymmetric TSP with weights zero and one. In Lecture Notes in Computer Science: Vol.\u00a03122. Proceedings of the 7th international workshop on approximation algorithms for combinatorial optimization problems (APPROX) (pp.\u00a061\u201371). Berlin: Springer."},{"issue":"3","key":"241_CR3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H. A. Eiselt","year":"1995","unstructured":"Eiselt, H. A., Gendreau, M., & Laporte, G. (1995). Arc routing problems\u00a0II. The rural postman problem. Operations Research, 43(3), 399\u2013414.","journal-title":"Operations Research"},{"key":"241_CR4","volume-title":"Computers and intractability","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. New York: Freeman."},{"key":"241_CR5","doi-asserted-by":"crossref","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 shop and flowshop. European Journal of Operational Research, 130, 90\u201398.","journal-title":"European Journal of Operational Research"},{"key":"241_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.dam.2003.09.010","volume":"145","author":"K. Giaro","year":"2004","unstructured":"Giaro, K., & Kubale, M. (2004). Compact scheduling of zero-one time operations in multi-stage systems. Discrete Applied Mathematics, 145, 95\u2013103.","journal-title":"Discrete Applied Mathematics"},{"key":"241_CR7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P. C. Gilmore","year":"1964","unstructured":"Gilmore, P. C., & Gomory, R. E. (1964). Sequencing a one state-variable machine: a\u00a0solvable case of the traveling salesman problem. Operations Research, 12, 655\u2013679.","journal-title":"Operations Research"},{"key":"241_CR8","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\u00a0survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"241_CR9","volume-title":"The traveling salesman problem and its variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., & Punnen, A. P. (2002). The traveling salesman problem and its variations. Berlin: Springer."},{"issue":"3","key":"241_CR10","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N. G. 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(3), 510\u2013525.","journal-title":"Operations Research"},{"key":"241_CR11","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1016\/S0098-1354(01)00729-3","volume":"25","author":"I. Harjunkoski","year":"2001","unstructured":"Harjunkoski, I., & Grossmann, I. (2001). A decomposition approach for the scheduling of a steel plant production. Computers & Chemical Engineering, 25, 1647\u20131660.","journal-title":"Computers & Chemical Engineering"},{"key":"241_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-218X(01)00271-2","volume":"119","author":"S. N. Kabadi","year":"2002","unstructured":"Kabadi, S. N. (2002). New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization. Discrete Applied Mathematics, 119, 149\u2013167.","journal-title":"Discrete Applied Mathematics"},{"key":"241_CR13","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. Miller & J. Thatcher (Eds.), Complexity of computer computations (pp.\u00a085\u2013103). New York: Plenum Press."},{"key":"241_CR14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","volume":"61","author":"G. Laporte","year":"1995","unstructured":"Laporte, G., & Osman, I. H. (1995). Routing problems: a\u00a0bibliography. Annals of Operation Research, 61, 227\u2013262.","journal-title":"Annals of Operation Research"},{"issue":"3","key":"241_CR15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J. K. Lenstra","year":"1976","unstructured":"Lenstra, J. K., & Kan, A. H. G. R. (1976). On general routing problems. Networks, 6(3), 273\u2013280.","journal-title":"Networks"},{"key":"241_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C. Orloff","year":"1974","unstructured":"Orloff, C. (1974). A fundamental problem in vehicle routing. Networks, 4, 35\u201364.","journal-title":"Networks"},{"issue":"12","key":"241_CR17","doi-asserted-by":"crossref","first-page":"2823","DOI":"10.1016\/j.compchemeng.2004.08.031","volume":"28","author":"D. Pacciarelli","year":"2004","unstructured":"Pacciarelli, D., & Pranzo, M. (2004). Production scheduling in a steelmaking-continuous casting plant. Computers & Chemical Engineering, 28(12), 2823\u20132835.","journal-title":"Computers & Chemical Engineering"},{"key":"241_CR18","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01963410","volume":"4","author":"J. Piehler","year":"1960","unstructured":"Piehler, J. (1960). Ein Beitrag zum Reihenfolgenproblem. Unternehmensforschung, 4, 138\u2013142.","journal-title":"Unternehmensforschung"},{"issue":"3","key":"241_CR19","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1057\/jors.1972.52","volume":"23","author":"S. S. Reddi","year":"1972","unstructured":"Reddi, S. S., & Ramamoorthy, C. V. (1972). On the flow-shop sequencing problem with no wait in process. Operational Research Quarterly, 23(3), 323\u2013331.","journal-title":"Operational Research Quarterly"},{"issue":"2","key":"241_CR20","doi-asserted-by":"crossref","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 flow shop is NP-complete. Journal of the Association for Computing Machinery, 31(2), 336\u2013345.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"241_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<149::AID-JOS10>3.0.CO;2-4","volume":"1","author":"G. Rote","year":"1998","unstructured":"Rote, G., & Woeginger, G. J. (1998). Time complexity and linear-time approximation of the ancient two-machine flow shop. Journal of Scheduling, 1(3), 149\u2013155.","journal-title":"Journal of Scheduling"},{"key":"241_CR22","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/moor.4.4.448","volume":"4","author":"S. Sahni","year":"1979","unstructured":"Sahni, S., & Cho, Y. (1979). Complexity of scheduling shops with no-wait in process. Mathematics of Operations Research, 4, 448\u2013457.","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"241_CR23","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1111\/1475-3995.00427","volume":"10","author":"C. Schwindt","year":"2003","unstructured":"Schwindt, C., & Trautmann, N. (2003). Scheduling the production of rolling ingots: industrial context, model, and solution method. International Transactions in Operational Research, 10(6), 547\u2013563.","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"241_CR24","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0377-2217(86)90036-6","volume":"24","author":"C. Sriskandarajah","year":"1986","unstructured":"Sriskandarajah, C., & Ladet, P. (1986). Some no-wait shops scheduling problems: complexity aspect. European Journal of Operational Research, 24(3), 424\u2013438.","journal-title":"European Journal of Operational Research"},{"key":"241_CR25","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/SFCS.2000.892071","volume-title":"41st Annual symposium on foundations of computer science (FOCS)","author":"M. Sviridenko","year":"2000","unstructured":"Sviridenko, M., & Woeginger, G. J. (2000). Approximability and in-approximability results for no-wait shop scheduling. In 41st Annual symposium on foundations of computer science (FOCS) (pp.\u00a0116\u2013125)."},{"issue":"6","key":"241_CR26","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1023\/A:1026200209386","volume":"6","author":"G. L. Vairaktarakis","year":"2003","unstructured":"Vairaktarakis, G. L. (2003). Simple algorithms for Gilmore\u2013Gomory\u2019s traveling salesman and related problems. Journal of Scheduling, 6(6), 499\u2013520.","journal-title":"Journal of Scheduling"},{"key":"241_CR27","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.orl.2004.10.004","volume":"33","author":"Z. Wang","year":"2005","unstructured":"Wang, Z., Xing, W., & Bai, F. (2005). No-wait flexible flowshop scheduling with no-idle machines. Operations Research Letters, 33, 609\u2013614.","journal-title":"Operations Research Letters"},{"key":"241_CR28","volume-title":"Introduction to graph theory","author":"D. B. West","year":"2001","unstructured":"West, D. B. (2001). Introduction to graph theory (2nd\u00a0edn.). Englewood Cliffs: Prentice-Hall.","edition":"2"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0241-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0241-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0241-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:46Z","timestamp":1559453986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0241-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,13]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["241"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0241-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,13]]}}}