A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems Article Swipe
In this paper, we analyze a variety of approaches to obtain lower bounds for multilevel production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish relationships between some of these methods that, to our knowledge, have not been presented before. As will be highlighted, understanding the substructures of difficult problems provides valuable insights on why these problems are hard to solve. We conclude with computational results from widely used test sets and discussion of future research.
Related Topics
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- https://strathprints.strath.ac.uk/view/author/711318.html>
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4323872281
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4323872281Canonical identifier for this work in OpenAlex
- Title
-
A Computational Analysis of Lower Bounds for Big Bucket Production Planning ProblemsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-04-04Full publication date if available
- Authors
-
Kerem Akartunalı, Andrew J. MillerList of authors in order
- Landing page
-
https://strathprints.strath.ac.uk/view/author/711318.html>Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://hal.science/hal-00387105Direct OA link when available
- Concepts
-
Production (economics), Production planning, Computer science, Economics, MicroeconomicsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4323872281 |
|---|---|
| doi | |
| ids.openalex | https://openalex.org/W4323872281 |
| fwci | |
| type | preprint |
| title | A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10551 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9840999841690063 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2209 |
| topics[0].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[0].display_name | Scheduling and Optimization Algorithms |
| topics[1].id | https://openalex.org/T11814 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9638000130653381 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Advanced Manufacturing and Logistics Optimization |
| topics[2].id | https://openalex.org/T12782 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9487000107765198 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2209 |
| topics[2].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[2].display_name | Assembly Line Balancing Optimization |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C2778348673 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6585605144500732 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q739302 |
| concepts[0].display_name | Production (economics) |
| concepts[1].id | https://openalex.org/C2777909354 |
| concepts[1].level | 3 |
| concepts[1].score | 0.5508553385734558 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1386523 |
| concepts[1].display_name | Production planning |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.4771135151386261 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C162324750 |
| concepts[3].level | 0 |
| concepts[3].score | 0.2018166184425354 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[3].display_name | Economics |
| concepts[4].id | https://openalex.org/C175444787 |
| concepts[4].level | 1 |
| concepts[4].score | 0.11312055587768555 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q39072 |
| concepts[4].display_name | Microeconomics |
| keywords[0].id | https://openalex.org/keywords/production |
| keywords[0].score | 0.6585605144500732 |
| keywords[0].display_name | Production (economics) |
| keywords[1].id | https://openalex.org/keywords/production-planning |
| keywords[1].score | 0.5508553385734558 |
| keywords[1].display_name | Production planning |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.4771135151386261 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/economics |
| keywords[3].score | 0.2018166184425354 |
| keywords[3].display_name | Economics |
| keywords[4].id | https://openalex.org/keywords/microeconomics |
| keywords[4].score | 0.11312055587768555 |
| keywords[4].display_name | Microeconomics |
| language | en |
| locations[0].id | pmh:oai:strathprints.strath.ac.uk:39630 |
| locations[0].is_oa | False |
| locations[0].source.id | https://openalex.org/S4306402226 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) |
| locations[0].source.host_organization | https://openalex.org/I181647926 |
| locations[0].source.host_organization_name | University of Strathclyde |
| locations[0].source.host_organization_lineage | https://openalex.org/I181647926 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | acceptedVersion |
| locations[0].raw_type | PeerReviewed |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://strathprints.strath.ac.uk/view/author/711318.html> |
| locations[1].id | pmh:oai:HAL:hal-00387105v1 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306402512 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| locations[1].source.host_organization | https://openalex.org/I1294671590 |
| locations[1].source.host_organization_name | Centre National de la Recherche Scientifique |
| locations[1].source.host_organization_lineage | https://openalex.org/I1294671590 |
| locations[1].license | other-oa |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | Preprints, Working Papers, ... |
| locations[1].license_id | https://openalex.org/licenses/other-oa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | 2009 |
| locations[1].landing_page_url | https://hal.science/hal-00387105 |
| locations[2].id | pmh:oai:oskar-bordeaux.fr:20.500.12278/116117 |
| locations[2].is_oa | False |
| locations[2].source.id | https://openalex.org/S4306402569 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | Oskar-Bordeaux (Universite de Bordeaux) |
| locations[2].source.host_organization | |
| locations[2].source.host_organization_name | |
| locations[2].license | |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | Document de travail - Pré-publication |
| locations[2].license_id | |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | |
| locations[2].landing_page_url | https://oskar-bordeaux.fr/handle/20.500.12278/116117 |
| locations[3].id | pmh:oai:oskar-bordeaux.fr:20.500.12278/190858 |
| locations[3].is_oa | False |
| locations[3].source.id | https://openalex.org/S4306402569 |
| locations[3].source.issn | |
| locations[3].source.type | repository |
| locations[3].source.is_oa | False |
| locations[3].source.issn_l | |
| locations[3].source.is_core | False |
| locations[3].source.is_in_doaj | False |
| locations[3].source.display_name | Oskar-Bordeaux (Universite de Bordeaux) |
| locations[3].source.host_organization | |
| locations[3].source.host_organization_name | |
| locations[3].license | |
| locations[3].pdf_url | |
| locations[3].version | submittedVersion |
| locations[3].raw_type | Document de travail - Pré-publication |
| locations[3].license_id | |
| locations[3].is_accepted | False |
| locations[3].is_published | False |
| locations[3].raw_source_name | |
| locations[3].landing_page_url | https://oskar-bordeaux.fr/handle/20.500.12278/190858 |
| authorships[0].author.id | https://openalex.org/A5054669154 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-0169-3833 |
| authorships[0].author.display_name | Kerem Akartunalı |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Akartunali, Kerem |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5080518736 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-0137-4093 |
| authorships[1].author.display_name | Andrew J. Miller |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Miller, Andrew J. |
| authorships[1].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://hal.science/hal-00387105 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T04:12:42.849631 |
| primary_topic.id | https://openalex.org/T10551 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9840999841690063 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2209 |
| primary_topic.subfield.display_name | Industrial and Manufacturing Engineering |
| primary_topic.display_name | Scheduling and Optimization Algorithms |
| related_works | https://openalex.org/W2049087584, https://openalex.org/W2390162585, https://openalex.org/W2900261087, https://openalex.org/W2965691246, https://openalex.org/W2332032866, https://openalex.org/W2380107638, https://openalex.org/W2972939276, https://openalex.org/W1595056580, https://openalex.org/W2376387986, https://openalex.org/W2527541164 |
| cited_by_count | 0 |
| locations_count | 4 |
| best_oa_location.id | pmh:oai:HAL:hal-00387105v1 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402512 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| best_oa_location.source.host_organization | https://openalex.org/I1294671590 |
| best_oa_location.source.host_organization_name | Centre National de la Recherche Scientifique |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I1294671590 |
| best_oa_location.license | other-oa |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | Preprints, Working Papers, ... |
| best_oa_location.license_id | https://openalex.org/licenses/other-oa |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | 2009 |
| best_oa_location.landing_page_url | https://hal.science/hal-00387105 |
| primary_location.id | pmh:oai:strathprints.strath.ac.uk:39630 |
| primary_location.is_oa | False |
| primary_location.source.id | https://openalex.org/S4306402226 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) |
| primary_location.source.host_organization | https://openalex.org/I181647926 |
| primary_location.source.host_organization_name | University of Strathclyde |
| primary_location.source.host_organization_lineage | https://openalex.org/I181647926 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | acceptedVersion |
| primary_location.raw_type | PeerReviewed |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://strathprints.strath.ac.uk/view/author/711318.html> |
| publication_date | 2024-04-04 |
| publication_year | 2024 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 5 |
| abstract_inverted_index.As | 62 |
| abstract_inverted_index.In | 0 |
| abstract_inverted_index.We | 33, 83 |
| abstract_inverted_index.an | 35 |
| abstract_inverted_index.be | 64 |
| abstract_inverted_index.in | 24 |
| abstract_inverted_index.of | 7, 38, 50, 69, 95 |
| abstract_inverted_index.on | 75 |
| abstract_inverted_index.to | 9, 54, 81 |
| abstract_inverted_index.we | 3 |
| abstract_inverted_index.and | 41, 44, 93 |
| abstract_inverted_index.are | 79 |
| abstract_inverted_index.big | 19 |
| abstract_inverted_index.for | 13, 29 |
| abstract_inverted_index.new | 42 |
| abstract_inverted_index.not | 58 |
| abstract_inverted_index.our | 55 |
| abstract_inverted_index.the | 30, 67 |
| abstract_inverted_index.why | 76 |
| abstract_inverted_index.also | 45 |
| abstract_inverted_index.been | 59 |
| abstract_inverted_index.both | 39 |
| abstract_inverted_index.from | 88 |
| abstract_inverted_index.give | 34 |
| abstract_inverted_index.hard | 80 |
| abstract_inverted_index.have | 57 |
| abstract_inverted_index.same | 31 |
| abstract_inverted_index.sets | 92 |
| abstract_inverted_index.some | 49 |
| abstract_inverted_index.test | 91 |
| abstract_inverted_index.this | 1 |
| abstract_inverted_index.used | 90 |
| abstract_inverted_index.will | 63 |
| abstract_inverted_index.with | 18, 85 |
| abstract_inverted_index.i.e., | 22 |
| abstract_inverted_index.items | 27 |
| abstract_inverted_index.known | 40 |
| abstract_inverted_index.lower | 11 |
| abstract_inverted_index.that, | 53 |
| abstract_inverted_index.these | 51, 77 |
| abstract_inverted_index.which | 25 |
| abstract_inverted_index.bounds | 12 |
| abstract_inverted_index.bucket | 20 |
| abstract_inverted_index.future | 96 |
| abstract_inverted_index.obtain | 10 |
| abstract_inverted_index.paper, | 2 |
| abstract_inverted_index.solve. | 82 |
| abstract_inverted_index.survey | 37 |
| abstract_inverted_index.widely | 89 |
| abstract_inverted_index.analyze | 4 |
| abstract_inverted_index.before. | 61 |
| abstract_inverted_index.between | 48 |
| abstract_inverted_index.compete | 28 |
| abstract_inverted_index.methods | 52 |
| abstract_inverted_index.results | 87 |
| abstract_inverted_index.variety | 6 |
| abstract_inverted_index.conclude | 84 |
| abstract_inverted_index.insights | 74 |
| abstract_inverted_index.methods, | 43 |
| abstract_inverted_index.multiple | 26 |
| abstract_inverted_index.planning | 16 |
| abstract_inverted_index.problems | 17, 23, 71, 78 |
| abstract_inverted_index.provides | 72 |
| abstract_inverted_index.valuable | 73 |
| abstract_inverted_index.difficult | 70 |
| abstract_inverted_index.establish | 46 |
| abstract_inverted_index.extensive | 36 |
| abstract_inverted_index.presented | 60 |
| abstract_inverted_index.research. | 97 |
| abstract_inverted_index.approaches | 8 |
| abstract_inverted_index.discussion | 94 |
| abstract_inverted_index.knowledge, | 56 |
| abstract_inverted_index.multilevel | 14 |
| abstract_inverted_index.production | 15 |
| abstract_inverted_index.resources. | 32 |
| abstract_inverted_index.capacities, | 21 |
| abstract_inverted_index.highlighted, | 65 |
| abstract_inverted_index.computational | 86 |
| abstract_inverted_index.relationships | 47 |
| abstract_inverted_index.substructures | 68 |
| abstract_inverted_index.understanding | 66 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile |