{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:23Z","timestamp":1759847303090,"version":"3.40.5"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1023\/a:1009643112214","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"5-28","source":"Crossref","is-referenced-by-count":3,"title":["A 3\/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times"],"prefix":"10.1007","volume":"5","author":[{"given":"V. A.","family":"Strusevich","sequence":"first","affiliation":[]},{"given":"A. J. A.","family":"van de Waart","sequence":"additional","affiliation":[]},{"given":"R.","family":"Dekker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"201984_CR1","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/05695558308974639","volume":"15","author":"I. Adiri","year":"1983","unstructured":"Adiri, I., and N. Amit. (1983). \u201cRoute-Depended Open-Shop Scheduling,\u201d IIE Transactions 15, 231\u2013234.","journal-title":"IIE Transactions"},{"key":"201984_CR2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/ijoc.5.3.321","volume":"5","author":"B. Chen","year":"1993","unstructured":"Chen, B., and V. A. Strusevich. (1993). \u201cApproximation Algorithms for Three Machine Open Shop Scheduling,\u201d ORSA Journal on Computing 5, 321\u2013326.","journal-title":"ORSA Journal on Computing"},{"key":"201984_CR3","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez, T., and S. Sahni. (1976). \u201cOpen Shop Scheduling to Minimize Finish Time,\u201d Journal of the Association for Computing Machinery 23, 665\u2013679.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"201984_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/nav.3800030307","volume":"3","author":"J. R. Jackson","year":"1956","unstructured":"Jackson, J. R. (1956). \u201cAn Extension of Johnson' Results on Job Lot Scheduling,\u201d Naval Research Logistics Quarterly 3, 201\u2013203.","journal-title":"Naval Research Logistics Quarterly"},{"key":"201984_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S. M. Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). \u201cOptimal Two-and Three-Stage Production Schedules with Set-Up Times Included,\u201d Naval Research Logistics Quarterly 1, 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"201984_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computation","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M. (1972). \u201cReducibility Among the Combinatorial Problems.\u201d In R. E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computation, pp. 85\u2013103. New York: Plenum Press."},{"key":"201984_CR7","first-page":"445","volume-title":"Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. (1993). \u201cSequencing and Scheduling: Algorithms and Complexity.\u201d In S. C. Graves, A. H. G. Rinnooy Kan, and P. Zipkin (eds.), Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, pp. 445\u2013522. Amsterdam: North-Holland."},{"key":"201984_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(85)90009-5","volume":"10","author":"C. N. Potts","year":"1985","unstructured":"Potts, C. N. (1985). \u201cAnalysis of a Linear Programming Heuristic for Scheduling Unrelated Parallel Machines.\u201d Discrete Applied Mathematics 10, 155\u2013164.","journal-title":"Discrete Applied Mathematics"},{"key":"201984_CR9","first-page":"191","volume":"82","author":"S. V. Sevast'janov","year":"1998","unstructured":"Sevast'janov, S. V., and G. J. Woeginger. (1998). \u201cMakespan Minimization in Open Shops: A Polynomial Time Approximation Scheme.\u201d Report SFB68, TU Graz, Austria, to appear in Mathematical Programming 82, 191\u2013198.","journal-title":"Mathematical Programming"},{"key":"201984_CR10","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S009753979222676X","volume":"23","author":"D. B. Shmoys","year":"1994","unstructured":"Shmoys, D. B., C. Stein, and J. Wein. (1994). \u201cImproved Approximation Algorithms for Shop Scheduling Problems.\u201d SIAM Journal on Computing 23, 617\u2013632.","journal-title":"SIAM Journal on Computing"},{"key":"201984_CR11","volume-title":"Scheduling Theory: Multi-Stage Systems","author":"V. S. Tanaev","year":"1994","unstructured":"Tanaev, V. S., Y. N. Sotskov, and V. A. Strusevich. (1994). Scheduling Theory: Multi-Stage Systems. Dordrecht: Kluwer Academic Publishers."},{"key":"201984_CR12","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"D. P. Williamson","year":"1997","unstructured":"Williamson, D. P., L.A. Hall, J. A. Hoogeveen, C. A. J. Hurkens, J. K. Lenstra, S.V. Sevast'janov, and D. B. Shmoys. (1997). \u201cShort Shop Schedules.\u201d Operations Research 45, 288\u2013294.","journal-title":"Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009643112214.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009643112214\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009643112214.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:49:06Z","timestamp":1747651746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009643112214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["201984"],"URL":"https:\/\/doi.org\/10.1023\/a:1009643112214","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}