{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:55:09Z","timestamp":1740099309462,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030226282"},{"type":"electronic","value":"9783030226299"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-22629-9_24","type":"book-chapter","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T20:02:42Z","timestamp":1560283362000},"page":"342-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Flow Shop with Job\u2013Dependent Buffer Requirements\u2014a Polynomial\u2013Time Algorithm and Efficient Heuristics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6144-0251","authenticated-orcid":false,"given":"Alexander","family":"Kononov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2395-1450","authenticated-orcid":false,"given":"Julia","family":"Memar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2024-8129","authenticated-orcid":false,"given":"Yakov","family":"Zinder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,12]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00291-003-0133-7","volume":"25","author":"P Brucker","year":"2003","unstructured":"Brucker, P., Heitmann, S., Hurink, J.: Flow-shop problems with intermediate buffers. OR Spectr. 25(4), 549\u2013574 (2003)","journal-title":"OR Spectr."},{"key":"24_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23929-8","volume-title":"Complex Scheduling","author":"P Brucker","year":"2012","unstructured":"Brucker, P., Knust, S.: Complex Scheduling. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-23929-8"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman Jr","year":"1978","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. 7(1), 1\u201317 (1978)","journal-title":"SIAM J. Comput."},{"key":"24_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5152-5","volume-title":"Flow Shop Scheduling","author":"H Emmons","year":"2013","unstructured":"Emmons, H., Vairaktarakis, G.: Flow Shop Scheduling. Springer, Boston (2013). \n                      https:\/\/doi.org\/10.1007\/978-1-4614-5152-5"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"ML Fisher","year":"2004","unstructured":"Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Manag. Sci. 50, 1861\u20131871 (2004)","journal-title":"Manag. Sci."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ins.2014.11.015","volume":"316","author":"J Fung","year":"2015","unstructured":"Fung, J., Singh, G., Zinder, Y.: Capacity planning in supply chains of mineral resources. Inf. Sci. 316, 397\u2013418 (2015)","journal-title":"Inf. Sci."},{"issue":"2","key":"24_CR7","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.: Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2), 153\u2013157 (2016)","journal-title":"Oper. Res. Lett."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2018.11.011","volume":"52\u201353","author":"H Gu","year":"2018","unstructured":"Gu, H., Kononov, A., Memar, J., Zinder, Y.: Efficient lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms 52\u201353, 143\u2013155 (2018)","journal-title":"J. Discrete Algorithms"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-75172-6_11","volume-title":"WALCOM: Algorithms and Computation","author":"H Gu","year":"2018","unstructured":"Gu, H., Memar, J., Zinder, Y.: Scheduling batch processing in flexible flowshop with job dependent buffer requirements: lagrangian relaxation approach. In: Rahman, M.S., Sung, W.-K., Uehara, R. (eds.) WALCOM 2018. LNCS, vol. 10755, pp. 119\u2013131. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-75172-6_11"},{"issue":"1","key":"24_CR10","first-page":"21","volume":"15","author":"T Irohara","year":"2010","unstructured":"Irohara, T.: Lagrangian relaxation algorithms for hybrid flow-shop scheduling problems with limited buffers. Int. J. Biomed. Soft Comput. Hum. Sci. 15(1), 21\u201328 (2010)","journal-title":"Int. J. Biomed. Soft Comput. Hum. Sci."},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two-and three-stage production schedules with setup times included. Nav. Res. Logist. Q. 1(1), 61\u201368 (1954)","journal-title":"Nav. Res. Logist. Q."},{"issue":"4","key":"24_CR12","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., Lin, F.C.: Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications. J. Sched. 15(4), 487\u2013497 (2012)","journal-title":"J. Sched."},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1134\/S1990478913010067","volume":"7","author":"P Kononova","year":"2013","unstructured":"Kononova, P., Kochetov, Y.A.: The variable neighborhood search for the two machine flow shop problem with a passive prefetch. J. Appl. Ind. Math. 7(1), 54\u201367 (2013)","journal-title":"J. Appl. Ind. Math."},{"issue":"4","key":"24_CR14","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1016\/j.cor.2008.01.002","volume":"36","author":"FC Lin","year":"2009","unstructured":"Lin, F.C., Hong, J.S., Lin, B.M.: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations. Comput. Oper. Res. 36(4), 1158\u20131175 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.is.2012.05.008","volume":"38","author":"FC Lin","year":"2013","unstructured":"Lin, F.C., Hong, J.S., Lin, B.M.: Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries. Inf. Syst. 38(1), 82\u201396 (2013)","journal-title":"Inf. Syst."},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.datak.2008.04.010","volume":"66","author":"FC Lin","year":"2008","unstructured":"Lin, F.C., Lai, C.Y., Hong, J.S.: Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries. Data Knowl. Eng. 66(3), 382\u2013401 (2008)","journal-title":"Data Knowl. Eng."},{"key":"24_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, New York (2012). \n                      https:\/\/doi.org\/10.1007\/978-1-4614-2361-4"},{"issue":"3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1057\/palgrave.jors.2602033","volume":"57","author":"LX Tang","year":"2006","unstructured":"Tang, L.X., Xuan, H.: Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers. J. Oper. Res. Soc. 57(3), 316\u2013324 (2006)","journal-title":"J. Oper. Res. Soc."},{"key":"24_CR19","unstructured":"van de Velde, S.L.: Machine scheduling and lagrangian relaxation (1991)"},{"issue":"8","key":"24_CR20","doi-asserted-by":"publisher","first-page":"2293","DOI":"10.1016\/j.cor.2005.09.004","volume":"34","author":"A Witt","year":"2007","unstructured":"Witt, A., Vo\u00df, S.: Simple heuristics for scheduling with limited intermediate storage. Comput. Oper. Res. 34(8), 2293\u20132309 (2007)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22629-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T20:04:36Z","timestamp":1560283476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22629-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030226282","9783030226299"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22629-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/motor2019.uran.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}