{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:14Z","timestamp":1740099614140,"version":"3.37.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030386283"},{"type":"electronic","value":"9783030386290"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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-38629-0_9","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T14:05:05Z","timestamp":1579615505000},"page":"106-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5671-8562","authenticated-orcid":false,"given":"Ilya","family":"Chernykh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5355-411X","authenticated-orcid":false,"given":"Artem","family":"Pyatkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"SF Assmann","year":"1984","unstructured":"Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.T.: On the dual of the one-dimensional bin packing problem. J. Algorithms 5(4), 502\u2013525 (1984). https:\/\/doi.org\/10.1016\/0196-6774(84)90004-X","journal-title":"J. Algorithms"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2003.06.050","volume":"166","author":"I Averbakh","year":"2005","unstructured":"Averbakh, I., Berman, O., Chernykh, I.: A 6\/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. Eur. J. Oper. Res. 166(1), 3\u201324 (2005). https:\/\/doi.org\/10.1016\/j.ejor.2003.06.050","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.ejor.2005.01.034","volume":"173","author":"I Averbakh","year":"2006","unstructured":"Averbakh, I., Berman, O., Chernykh, I.: The routing open-shop problem on a network: complexity and approximation. Eur. J. Oper. Res. 173(2), 531\u2013539 (2006). https:\/\/doi.org\/10.1016\/j.ejor.2005.01.034","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"S93","DOI":"10.1057\/jors.2008.169","volume":"60","author":"JA Bennell","year":"2009","unstructured":"Bennell, J.A., Oliveira, J.: A tutorial in irregular shape packing problems. J. Oper. Res. Soc. 60, S93\u2013S105 (2009). https:\/\/doi.org\/10.1057\/jors.2008.169","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10732-008-9095-x","volume":"16","author":"JA Bennell","year":"2010","unstructured":"Bennell, J.A., Song, X.: A beam search implementation for the irregular shape packing problem. J. Heuristics 16(2), 167\u2013188 (2010). https:\/\/doi.org\/10.1007\/s10732-008-9095-x","journal-title":"J. Heuristics"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2003.06.018","volume":"160","author":"EG Birgin","year":"2005","unstructured":"Birgin, E.G., Martnez, J.M., Ronconi, D.P.: Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. Eur. J. Oper. Res. 160, 19\u201333 (2005). https:\/\/doi.org\/10.1016\/j.ejor.2003.06.018","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2006.06.001","volume":"362","author":"J Boyar","year":"2006","unstructured":"Boyar, J., et al.: The maximum resource bin packing problem. Theor. Comput. Sci. 362(1), 127\u2013139 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.06.001","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.cor.2012.01.006","volume":"40","author":"I Chernykh","year":"2013","unstructured":"Chernykh, I., Kononov, A.V., Sevastyanov, S.: Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40(3), 841\u2013847 (2013). https:\/\/doi.org\/10.1016\/j.cor.2012.01.006","journal-title":"Comput. Oper. Res."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-319-44914-2_23","volume-title":"Discrete Optimization and Operations Research","author":"I Chernykh","year":"2016","unstructured":"Chernykh, I., Lgotina, E.: The 2-machine routing open shop on a triangular transportation network. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 284\u2013297. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_23"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Chernykh, I., Lgotina, E.: Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (2019). Submitted to Optimization Methods and Software","DOI":"10.1080\/10556788.2020.1734802"},{"key":"9_CR11","unstructured":"Christensen, H.I., Khan, A., Pokutta, S., Tetali, P.: Multidimensional bin packing and other related problems: a survey (2016). https:\/\/people.math.gatech.edu\/~tetali\/PUBLIS\/CKPT.pdf"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF00288885","volume":"9","author":"EG Coffman Jr","year":"1978","unstructured":"Coffman Jr., E.G., Leung, J.Y., Ting, D.W.: Bin packing: maximizing the number of pieces packed. Acta Inf. 9(3), 263\u2013271 (1978). https:\/\/doi.org\/10.1007\/BF00288885","journal-title":"Acta Inf."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of Combinatorial Optimization","author":"EG Coffman Jr","year":"2013","unstructured":"Coffman Jr., E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 455\u2013531. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_35"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10951-009-0129-5","volume":"15","author":"L Epstein","year":"2012","unstructured":"Epstein, L., Favrholdt, L.M., Kohrt, J.S.: Comparing online algorithms for bin packing problems. J. Sched. 15(1), 13\u201321 (2012). https:\/\/doi.org\/10.1007\/s10951-009-0129-5","journal-title":"J. Sched."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"1975","DOI":"10.1016\/j.dam.2013.03.020","volume":"161","author":"L Epstein","year":"2013","unstructured":"Epstein, L., Imreh, C., Levin, A.: Bin covering with cardinality constraints. Discrete Appl. Math. 161, 1975\u20131987 (2013). https:\/\/doi.org\/10.1016\/j.dam.2013.03.020","journal-title":"Discrete Appl. Math."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1137\/060666329","volume":"19","author":"L Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: On bin packing with conflicts. SIAM J. Optim. 19, 1270\u20131298 (2008). https:\/\/doi.org\/10.1137\/060666329","journal-title":"SIAM J. Optim."},{"key":"9_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"TF Gonzalez","year":"1976","unstructured":"Gonzalez, T.F., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23(4), 665\u2013679 (1976). https:\/\/doi.org\/10.1145\/321978.321985","journal-title":"J. ACM"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/s0304-3975(03)00363-3","volume":"306","author":"K Jansen","year":"2003","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic fully polynomial time approximation scheme for bin covering. Theoret. Comput. Sci. 306, 543\u2013551 (2003). https:\/\/doi.org\/10.1016\/s0304-3975(03)00363-3","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR20","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/a:1018986731638","volume":"92","author":"A Kononov","year":"1999","unstructured":"Kononov, A., Sevastianov, S., Tchernykh, I.: When difference in machine loads leads to efficient scheduling in open shops. Ann. Oper. Res. 92, 211\u2013239 (1999). https:\/\/doi.org\/10.1023\/a:1018986731638","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1134\/s1990478912030064","volume":"6","author":"A Kononov","year":"2012","unstructured":"Kononov, A.: On the routing open shop problem with two machines on a two-vertex network. J. Appl. Ind. Math. 6(3), 318\u2013331 (2012). https:\/\/doi.org\/10.1134\/s1990478912030064","journal-title":"J. Appl. Ind. Math."},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory","author":"Eugene L. Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Chapter 9. Sequencing and scheduling: algorithms and complexity. In: Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, vol. 4, pp. 445\u2013522. Elsevier (1993). https:\/\/doi.org\/10.1016\/S0927-0507(05)80189-6"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1134\/s1064226918060177","volume":"63","author":"MS Levin","year":"2018","unstructured":"Levin, M.S.: Bin packing problems (promising models and examples). J. Commun. Technol. Electron. 63, 655\u2013666 (2018). https:\/\/doi.org\/10.1134\/s1064226918060177","journal-title":"J. Commun. Technol. Electron."},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241\u2013252 (2002). https:\/\/doi.org\/10.1016\/S0377-2217(02)00123-6","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Oper. Res. 48, 256\u2013267 (2000). https:\/\/doi.org\/10.1287\/opre.48.2.256.12386","journal-title":"Oper. Res."},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/ijoc.1090.0355","volume":"22","author":"AEF Muritiba","year":"2010","unstructured":"Muritiba, A.E.F., Iori, M., Malaguti, E., Toth, P.: Algorithms for the bin packing problem with conflicts. INFORMS J. Comput. 22, 401\u2013415 (2010). https:\/\/doi.org\/10.1287\/ijoc.1090.0355","journal-title":"INFORMS J. Comput."},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/s0097539702412908","volume":"32","author":"SS Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R., Epstein, L.: New bounds for variable sized online bin packing. SIAM J. Comput. 32, 455\u2013469 (2003). https:\/\/doi.org\/10.1137\/s0097539702412908","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"9_CR29","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01585871","volume":"82","author":"Sergey V. Sevastianov","year":"1998","unstructured":"Sevastianov, S.V., Woeginger, G.J.: Makespan minimization in open shops: a polynomial time approximation scheme. Math. Program. 82(1-2, Ser. B), 191\u2013198 (1998). https:\/\/doi.org\/10.1007\/BF01585871","journal-title":"Mathematical Programming"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-68530-8_42","volume-title":"Algorithms \u2014 ESA\u2019 98","author":"SV Sevastianov","year":"1998","unstructured":"Sevastianov, S.V., Tchernykh, I.D.: Computer-aided way to prove theorems in scheduling. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 502\u2013513. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-68530-8_42"},{"issue":"2","key":"9_CR31","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"DP Williamson","year":"1997","unstructured":"Williamson, D.P., et al.: Short shop schedules. Oper. Res. 45(2), 288\u2013294 (1997). https:\/\/doi.org\/10.1287\/opre.45.2.288","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T04:06:55Z","timestamp":1614053215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}