{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:46:45Z","timestamp":1743148005100,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_112","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"1139-1148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2120-2595","authenticated-orcid":false,"given":"Joanna","family":"Berli\u0144ska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6144-0251","authenticated-orcid":false,"given":"Alexander","family":"Kononov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yakov","family":"Zinder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"112_CR1","unstructured":"Berli\u0144ska, J.: Scheduling for data gathering networks with data compression: Berli\u0144ska. J. Eur. J. Oper. Res. 246, 744\u2013749 (2015)"},{"key":"112_CR2","doi-asserted-by":"publisher","unstructured":"Berli\u0144ska, J.: Scheduling data gathering with maximum lateness objective. In: Wyrzykowski, R. et al. (eds.) PPAM 2017, Part II. LNCS, vol. 10778, pp. 135\u2013144. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-78054-2_13","DOI":"10.1007\/978-3-319-78054-2_13"},{"key":"112_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03185-3","author":"J Berli\u0144ska","year":"2019","unstructured":"Berli\u0144ska, J.: Heuristics for scheduling data gathering with limited base station memory. Ann. Oper. Res. (2019). \n                    https:\/\/doi.org\/10.1007\/s10479-019-03185-3\n                    \n                  . In press","journal-title":"Ann. Oper. Res."},{"key":"112_CR4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02283747","volume":"16","author":"J B\u0142a\u017cewicz","year":"1988","unstructured":"B\u0142a\u017cewicz, J., Kubiak, W., Szwarcfiter, J.: Scheduling unit-time tasks on flow-shops under resource constraints. Ann. Oper. Res. 16, 255\u2013266 (1988)","journal-title":"Ann. Oper. Res."},{"key":"112_CR5","unstructured":"B\u0142a\u017cewicz J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5, 11\u201324 (1983)"},{"key":"112_CR6","doi-asserted-by":"crossref","unstructured":"Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within \n                    \n                      \n                    \n                    $$1+ \\varepsilon $$\n                   in linear time. Combinatorica 1(4), 349\u2013355 (1981)","DOI":"10.1007\/BF02579456"},{"issue":"2","key":"112_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.orl.2015.12.012","volume":"44","author":"J Fung","year":"2016","unstructured":"Fung, J., Zinder, Y.: Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2), 153\u2013157 (2016)","journal-title":"Oper. Res. Lett."},{"key":"112_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"112_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.jda.2018.11.011","volume":"52\u201353","author":"H Gu","year":"2018","unstructured":"Gu, H., Memar, J., Kononov, A., Zinder, Y.: Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discret. Algorithms 52\u201353, 143\u2013155 (2018)","journal-title":"J. Discret. Algorithms"},{"issue":"11","key":"112_CR10","doi-asserted-by":"crossref","first-page":"3158","DOI":"10.1007\/s00453-017-0373-6","volume":"80","author":"W Luo","year":"2018","unstructured":"Luo, W., Xu, Y., Gu, B., Tong, W., Goebel, R., Lin, G.: Algorithms for communication scheduling in data gathering network with data compression. Algorithmica 80(11), 3158\u20133176 (2018)","journal-title":"Algorithmica"},{"issue":"1","key":"112_CR11","first-page":"1","volume":"28","author":"H R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H.: Some new results in no-wait flow shop scheduling. Z. Oper. Res. 28(1), 1\u201316 (1984)","journal-title":"Z. Oper. Res."},{"issue":"6","key":"112_CR12","first-page":"497","volume":"36","author":"H S\u00fcral","year":"1992","unstructured":"S\u00fcral, H., Kondakci, S., Erkip, N.: Scheduling unit-time tasks in renewable resource constrained flowshops. Z. Oper. Res. 36(6), 497\u2013516 (1992)","journal-title":"Z. Oper. Res."}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T06:02:02Z","timestamp":1572588122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_112","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}