{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:30:18Z","timestamp":1774369818423,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T00:00:00Z","timestamp":1618704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T00:00:00Z","timestamp":1618704000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10878-021-00741-1","type":"journal-article","created":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T17:02:31Z","timestamp":1618765351000},"page":"71-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A 3\/2-approximation for big two-bar charts packing"],"prefix":"10.1007","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2183-523X","authenticated-orcid":false,"given":"Adil","family":"Erzin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgii","family":"Melidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stepan","family":"Nazarenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Plotnikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,18]]},"reference":[{"key":"741_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0196-6774(85)90018-5","volume":"6","author":"BS Baker","year":"1985","unstructured":"Baker BS (1985) A new proof for the first-fit decreasing bin-packing algorithm. J Algorithms 6:49\u201370","journal-title":"J Algorithms"},{"key":"741_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74450-4_1","volume":"4614","author":"Gy D\u00f3sa","year":"2007","unstructured":"D\u00f3sa Gy (2007) The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is $$FFD(I)\\le 11\/9 OPT(I)+6\/9$$. Lecture Notes in Computer Sciences 4614:1\u201311","journal-title":"Lecture Notes in Computer Sciences"},{"key":"741_CR3","first-page":"336","volume":"1275","author":"A Erzin","year":"2020","unstructured":"Erzin A et al (2020) Optimal investment in the development of oil and gas field. Commun Comput Inf Sci 1275:336\u2013349","journal-title":"Commun Comput Inf Sci"},{"key":"741_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-020-01657-1","author":"A Erzin","year":"2020","unstructured":"Erzin A et al (2020) Two-Bar Charts Packing Problem. Optim Lett (online). https:\/\/doi.org\/10.1007\/s11590-020-01657-1","journal-title":"Optim Lett (online)"},{"key":"741_CR5","unstructured":"Gabow HN (1990) Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434\u2013443"},{"issue":"1","key":"741_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/6462.6502","volume":"18","author":"Z Galil","year":"1986","unstructured":"Galil Z (1986) Efficient algorithms for finding maximum matching in graphs. ACM Comput Surv 18(1):23\u201338","journal-title":"ACM Comput Surv"},{"key":"741_CR7","doi-asserted-by":"crossref","unstructured":"Gimadi E, Sevastianov S, On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign, Selected papers in Operations Research Proceedings 2002, Berlin-Heidelberg: Springer, pp. 241\u2013246 (2003)","DOI":"10.1007\/978-3-642-55537-4_39"},{"issue":"3","key":"741_CR8","first-page":"11","volume":"21","author":"E Goncharov","year":"2014","unstructured":"Goncharov E (2014) A stochastic greedy algorithm for the resource-constrained project scheduling problem. Dis Anal Oper Res 21(3):11\u201324","journal-title":"Dis Anal Oper Res"},{"issue":"6","key":"741_CR9","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1134\/S0005117917060108","volume":"78","author":"EN Goncharov","year":"2017","unstructured":"Goncharov EN, Leonov VV (2017) Genetic algorithm for the resource-constrained project scheduling problem. Autom Remote Control 78(6):1101\u20131114","journal-title":"Autom Remote Control"},{"key":"741_CR10","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/nav.10029","volume":"49","author":"S Hartmann","year":"2002","unstructured":"Hartmann S (2002) A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Res Logist 49:433\u2013448","journal-title":"Naval Res Logist"},{"key":"741_CR11","unstructured":"Johnson D.S, (1973) Near-optimal bin packing algorithms. Massachusetts Institute of Technology. PhD thesis"},{"issue":"1","key":"741_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0885-064X(85)90022-6","volume":"1","author":"DS Johnson","year":"1985","unstructured":"Johnson DS, Garey MR (1985) A 71\/60 theorem for bin packing. J Complex 1(1):65\u2013106","journal-title":"J Complex"},{"key":"741_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174:23\u201337","journal-title":"Eur J Oper Res"},{"issue":"7","key":"741_CR14","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1016\/j.cor.2008.09.004","volume":"36","author":"R Lewis","year":"2009","unstructured":"Lewis R (2009) A general-purpose hill-climbing method for order independent minimum grouping problems: a case study in graph colouring and bin packing. Comput Oper Res 36(7):2295\u20132310","journal-title":"Comput Oper Res"},{"issue":"15","key":"741_CR15","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1007\/BF02882754","volume":"42","author":"R Li","year":"1997","unstructured":"Li R, Yue M (1997) The proof of $$FFD(L)\\le 11\/9 OPT(L)+7\/9$$. Chin Sci Bull 42(15):1262\u20131265","journal-title":"Chin Sci Bull"},{"key":"741_CR16","volume-title":"Approxim Algorithms","author":"V VaziraniV","year":"2001","unstructured":"VaziraniV V (2001) Approxim Algorithms. Springer, Berlin"},{"key":"741_CR17","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.4236\/jamp.2018.69152","volume":"6","author":"YT Xie","year":"2018","unstructured":"Xie YT (2018) An $$O(n^{2.5})$$ algorithm: for maximum matchings in general graphs. J Appl Math Phys 6:1773\u20131782","journal-title":"J Appl Math Phys"},{"issue":"4","key":"741_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02009683","volume":"7","author":"M Yue","year":"1991","unstructured":"Yue M (1991) A simple proof of the inequality $$FFD(L)\\le 11\/9 OPT(L)+1, \\forall L$$, for the FFD bin-packing algorithm. Acta Math Appl Sinica 7(4):321\u2013331","journal-title":"Acta Math Appl Sinica"},{"issue":"3","key":"741_CR19","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BF02011198","volume":"11","author":"M Yue","year":"1995","unstructured":"Yue M, Zhang L (1995) A simple proof of the inequality $$MFFD(L)\\le 71\/60 OPT(L)+1, \\forall L$$, for the MFFD bin-packing algorithm. Acta Math Appl Sinica 11(3):318\u2013330","journal-title":"Acta Math Appl Sinica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00741-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00741-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00741-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T05:10:30Z","timestamp":1626066630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00741-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,18]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["741"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00741-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,18]]},"assertion":[{"value":"8 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}