{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:46Z","timestamp":1725488986362},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_32","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T12:28:21Z","timestamp":1186748901000},"page":"191-196","source":"Crossref","is-referenced-by-count":0,"title":["Two-Machine No-Wait Flow Shop Scheduling Problem with Precedence Constraints"],"prefix":"10.1007","author":[{"given":"Saied","family":"Samie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behrooz","family":"Karimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"655679","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P.C. Gilmore","year":"1964","unstructured":"P.C. Gilmore, R.E. Gomory, Sequencing a one-state variable machine: a solvable case of the traveling salesman problem, Oper. Res. 12 (1964) 655679","journal-title":"Oper. Res."},{"key":"32_CR2","first-page":"87143","volume-title":"The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization","author":"P.C. Gilmore","year":"1985","unstructured":"P.C. Gilmore, E.L. Lawler, D.B. Shmoys, Well solved special cases, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985, pp. 87143"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"6168","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"S.M. Johnson, Optimal two-and three-stage production schedules with setup times included, Naval Res. Logist. Quart. 1 (1954) 6168","journal-title":"Naval Res. Logist. Quart."},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.orl.2004.06.003","volume":"33","author":"J.-L. Bouquard","year":"2005","unstructured":"J.-L. Bouquard, J.-C. Billaut, M.A. Kubzin, V.A. Strusevich, Two-machine flowshop scheduling problems with no-wait jobs, Operations Research Letters 33 (2005) 255\u2013262","journal-title":"Operations Research Letters"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"21972212","DOI":"10.1016\/j.cor.2004.02.009","volume":"32","author":"J. Grabowski","year":"2005","unstructured":"Jozef Grabowski, Jaroslaw Pempera, Some local search algorithms for no-wait & flow-shop problem with makespan criterion, Computers & Operations Research 32 (2005) 21972212","journal-title":"Computers & Operations Research"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:06:13Z","timestamp":1605744373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_32","relation":{},"subject":[]}}