{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:46:21Z","timestamp":1775054781580,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,5]],"date-time":"2013-11-05T00:00:00Z","timestamp":1383609600000},"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":[[2015,6]]},"DOI":"10.1007\/s10951-013-0356-7","type":"journal-article","created":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T05:44:04Z","timestamp":1383543844000},"page":"311-314","source":"Crossref","is-referenced-by-count":14,"title":["A cyclical search for the two machine flow shop and open shop to minimise finishing time"],"prefix":"10.1007","volume":"18","author":[{"given":"Alan J.","family":"Soper","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,5]]},"reference":[{"key":"356_CR1","doi-asserted-by":"crossref","unstructured":"de Werra, D. (1989). Graph-theoretical models for preemptive scheduling. In R. Slowinski & J. Weglarz (Eds.), Advances in project scheduling (pp. 171\u2013185). Amsterdam: Elsevier.","DOI":"10.1016\/B978-0-444-87358-3.50012-2"},{"key":"356_CR2","doi-asserted-by":"crossref","unstructured":"Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. J Assoc Comput Mach, 23, 665\u2013679.","DOI":"10.1145\/321978.321985"},{"key":"356_CR3","doi-asserted-by":"crossref","unstructured":"Gribkovskaia, I. V., Lee, C.-Y., Strusevich, V. A., & de Werra, D. (2006). Three is easy, two is hard: open shop sum-batch scheduling problem refined. Oper Res Lett, 34, 459\u2013464.","DOI":"10.1016\/j.orl.2005.07.006"},{"key":"356_CR4","doi-asserted-by":"crossref","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 Res Logist Quart, 1, 61\u201368.","journal-title":"Naval Res Logist Quart"},{"key":"356_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-94-009-7801-0_9","volume-title":"Deterministic and stochastic scheduling","author":"M Pinedo","year":"1982","unstructured":"Pinedo, M., & Schrage, L. (1982). Stochastic shop scheduling a survey. In M. A. H. Dempster, E. L. Lawler, J. K. Lenstra, & A. H. G. Rinnooy Kan (Eds.), Deterministic and stochastic scheduling (pp. 181\u2013196). Dordrecht: Riedel."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0356-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0356-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0356-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:49Z","timestamp":1559453989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0356-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,5]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["356"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0356-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,5]]}}}