{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:51Z","timestamp":1759847391990},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T00:00:00Z","timestamp":1383004800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-013-9670-4","type":"journal-article","created":{"date-parts":[[2013,10,28]],"date-time":"2013-10-28T08:59:33Z","timestamp":1382950773000},"page":"36-52","source":"Crossref","is-referenced-by-count":13,"title":["A combination of flow shop scheduling and the shortest path problem"],"prefix":"10.1007","volume":"29","author":[{"given":"Kameng","family":"Nip","sequence":"first","affiliation":[]},{"given":"Zhenbo","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Fabrice","family":"Talla Nobibon","sequence":"additional","affiliation":[]},{"given":"Roel","family":"Leus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,29]]},"reference":[{"key":"9670_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs"},{"key":"9670_CR2","doi-asserted-by":"crossref","unstructured":"Aissi H, Bazgan C, Vanderpooten D (2006) Approximating min\u2013max (regret) versions of some polynomial problems. In: Chen D, Pardolos PM (eds) COCOON 2006, LNCS, vol 4112. Springer, Heidelberg, pp 428\u2013438","DOI":"10.1007\/11809678_45"},{"key":"9670_CR3","unstructured":"Batagelj V, Brandenburg FJ, Mendez P, Sen A (2000) The generalized shortest path problem. CiteSeer Archives."},{"key":"9670_CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(94)90009-4","volume":"55","author":"HL Bodlaender","year":"1994","unstructured":"Bodlaender HL, Jansen K, Woeginger GJ (1994) Scheduling with incompatible jobs. Disc Appl Math 55:219\u2013232","journal-title":"Disc Appl Math"},{"key":"9670_CR5","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1287\/opre.44.6.891","volume":"44","author":"B Chen","year":"1996","unstructured":"Chen B, Glass CA, Potts CN, Strusevich VA (1996) A new heuristic for three-machine flow shop scheduling. Oper Res 44:891\u2013898","journal-title":"Oper Res"},{"key":"9670_CR6","unstructured":"Conway RW, Maxwell W, Miller L (1967) Theory of scheduling. Addison-Wesley, Reading"},{"key":"9670_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"key":"9670_CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117\u2013129","journal-title":"Math Oper Res"},{"key":"9670_CR9","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9670_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/opre.26.1.36","volume":"26","author":"T Gonzalez","year":"1978","unstructured":"Gonzalez T, Sahni S (1978) Flowshop and jobshop schedules: complexity and approximation. Oper Res 26:36\u201352","journal-title":"Oper Res"},{"key":"9670_CR11","first-page":"175","volume":"82","author":"LA Hall","year":"1998","unstructured":"Hall LA (1998) Approximability of flow shop scheduling. Math Program 82:175\u2013190","journal-title":"Math Program"},{"key":"9670_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1:61\u201368","journal-title":"Nav Res Logist Q"},{"key":"9670_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer, Boston"},{"key":"9670_CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1051\/ro\/1983170201051","volume":"17","author":"CL Monma","year":"1983","unstructured":"Monma CL, Rinnooy Kan AHG (1983) A concise survey of eciently solvable special cases of the permutation flow-shop problem. RAIRO Rech Oper 17:105\u2013119","journal-title":"RAIRO Rech Oper"},{"key":"9670_CR15","first-page":"303","volume":"45","author":"H R\u00f6ck","year":"1982","unstructured":"R\u00f6ck H, Schmidt G (1982) Machine aggregation heuristics in shop scheduling. Method Oper Res 45:303\u2013314","journal-title":"Method Oper Res"},{"key":"9670_CR16","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.tcs.2012.06.003","volume":"460","author":"Z Wang","year":"2012","unstructured":"Wang Z, Cui Z (2012) Combination of parallel machine scheduling and vertex cover. Theor Comput Sci 460:10\u201315","journal-title":"Theor Comput Sci"},{"key":"9670_CR17","unstructured":"Wang Z, Hong W, He D (2013) Combination of parallel machine scheduling and covering problem. Working paper, Tsinghua University"},{"key":"9670_CR18","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A Warburton","year":"1987","unstructured":"Warburton A (1987) Approximation of pareto optima in multiple-objective, shortest-path problems. Oper Res 35:70\u201379","journal-title":"Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9670-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9670-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9670-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T10:59:38Z","timestamp":1564570778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9670-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,29]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9670"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9670-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,29]]}}}