{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:25Z","timestamp":1740103825556,"version":"3.37.3"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:00:00Z","timestamp":1555891200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:00:00Z","timestamp":1555891200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002628","name":"Incheon National University","doi-asserted-by":"publisher","award":["2017-0484"],"id":[{"id":"10.13039\/501100002628","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10951-019-00608-8","type":"journal-article","created":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T15:03:21Z","timestamp":1555945401000},"page":"327-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Two-machine flow shops with an optimal permutation schedule under a storage constraint"],"prefix":"10.1007","volume":"23","author":[{"given":"Yunhong","family":"Min","sequence":"first","affiliation":[]},{"given":"Byung-Cheon","family":"Choi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3382-6514","authenticated-orcid":false,"given":"Myoung-Ju","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,22]]},"reference":[{"key":"608_CR1","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., & Khanna, S. (2005). A polynomial time approximation scheme for the multiple Knapsack problem. SIAM Journal on Computing, 35, 713\u2013728.","journal-title":"SIAM Journal on Computing"},{"key":"608_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.orl.2015.12.012","volume":"44","author":"J Fung","year":"2016","unstructured":"Fung, J., & Zinder, Y. (2016). Permutation schedules for a two-machine flow shop with storage. Operations Research Letters, 44, 153\u2013157.","journal-title":"Operations Research Letters"},{"key":"608_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10951-011-0235-z","volume":"15","author":"A Kononov","year":"2012","unstructured":"Kononov, A., Hong, J. S., Kononova, P. K., & Lin, F. C. (2012). Quantity-based buffer-constrained two-machine flowshop problem: Active and passive prefetch models for multimedia applications. Journal of Scheduling, 15, 487\u2013497.","journal-title":"Journal of Scheduling"},{"key":"608_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1134\/S1990478913010067","volume":"7","author":"PA Kononova","year":"2013","unstructured":"Kononova, P. A., & Kochetov, Y. A. (2013). The variable neighborhood search for the two machine flow shop problem with a passive prefetch. Journal of Applied and Industrial Mathematics, 7, 54\u201367.","journal-title":"Journal of Applied and Industrial Mathematics"},{"key":"608_CR5","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1016\/j.cor.2008.01.002","volume":"36","author":"F-C Lina","year":"2009","unstructured":"Lina, F.-C., Honga, J.-S., & Lin, B. M. T. (2009). A two-machine flowshop problem with processing time-dependent buffer constraints. An application in multimedia presentations. Computers & Operations Research, 36, 1158\u20131175.","journal-title":"Computers & Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00608-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-019-00608-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00608-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T05:17:21Z","timestamp":1590556641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-019-00608-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,22]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["608"],"URL":"https:\/\/doi.org\/10.1007\/s10951-019-00608-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2019,4,22]]},"assertion":[{"value":"22 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}