{"id":"https://openalex.org/W2605064140","doi":"https://doi.org/10.1145/3071178.3071223","title":"Just-in-time batch scheduling problem with two-dimensional bin packing constraints","display_name":"Just-in-time batch scheduling problem with two-dimensional bin packing constraints","publication_year":2017,"publication_date":"2017-06-30","ids":{"openalex":"https://openalex.org/W2605064140","doi":"https://doi.org/10.1145/3071178.3071223","mag":"2605064140"},"language":"en","primary_location":{"id":"doi:10.1145/3071178.3071223","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3071178.3071223","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1703.07290","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082401107","display_name":"Sergey Polyakovskiy","orcid":"https://orcid.org/0000-0001-9489-1972"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Sergey Polyakovskiy","raw_affiliation_strings":["University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060704102","display_name":"Alexander Makarowsky","orcid":null},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Alexander Makarowsky","raw_affiliation_strings":["University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076485787","display_name":"Rym M\u2019Hallah","orcid":"https://orcid.org/0000-0001-6775-7276"},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":false,"raw_author_name":"Rym M'Hallah","raw_affiliation_strings":["University of Kuwait"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kuwait","institution_ids":["https://openalex.org/I36721946"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3381,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86908691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"321","last_page":"328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.8557790517807007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6380887627601624},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.5874899625778198},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5769354104995728},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4894391596317291},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47219526767730713},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44920432567596436},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4384174644947052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27502742409706116},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2245861291885376},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.12646517157554626},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09499651193618774}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8557790517807007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6380887627601624},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.5874899625778198},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5769354104995728},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4894391596317291},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47219526767730713},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44920432567596436},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4384174644947052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27502742409706116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2245861291885376},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.12646517157554626},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09499651193618774},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3071178.3071223","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3071178.3071223","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1703.07290","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1703.07290","pdf_url":"https://arxiv.org/pdf/1703.07290","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/134828","is_oa":false,"landing_page_url":"https://hdl.handle.net/2440/134828","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.acm.org/","raw_type":"Conference paper"},{"id":"pmh:oai:dro.deakin.edu.au:DU:30106177","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401102","display_name":"Own your potential (DEAKIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149704539","host_organization_name":"Deakin University","host_organization_lineage":["https://openalex.org/I149704539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:figshare.com:article/20814076","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Just-in-time_batch_scheduling_problem_with_two-dimensional_bin_packing_constraints/20814076","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1703.07290","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1703.07290","pdf_url":"https://arxiv.org/pdf/1703.07290","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1490891821","https://openalex.org/W1499680727","https://openalex.org/W1548063969","https://openalex.org/W1603112752","https://openalex.org/W1713438669","https://openalex.org/W1985424519","https://openalex.org/W2003463019","https://openalex.org/W2036267200","https://openalex.org/W2044872085","https://openalex.org/W2058056194","https://openalex.org/W2071782633","https://openalex.org/W2072344787","https://openalex.org/W2074337226","https://openalex.org/W2092286257","https://openalex.org/W2131422526","https://openalex.org/W2140003718","https://openalex.org/W2157321006","https://openalex.org/W2170168261","https://openalex.org/W2232398989","https://openalex.org/W2912248191","https://openalex.org/W4244166692","https://openalex.org/W4254819726","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W173368591","https://openalex.org/W2034272113","https://openalex.org/W2138242427","https://openalex.org/W2104955674","https://openalex.org/W4288260564","https://openalex.org/W2068892231","https://openalex.org/W2096053066","https://openalex.org/W2001915926"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"and":[3,32,34,51,64,99,114,153],"approximately":[4],"solves":[5],"a":[6,43,60,75,89,107,140],"multi-component":[7],"problem":[8,105],"where":[9],"small":[10],"rectangular":[11,17],"items":[12,73,152],"are":[13],"produced":[14],"from":[15,55],"large":[16],"bins":[18],"via":[19,106],"guillotine":[20],"cuts.":[21],"An":[22],"item":[23,41],"is":[24,46,86,122,136],"characterized":[25],"by":[26],"its":[27,49,69],"width,":[28],"height,":[29],"due":[30],"date,":[31],"earliness":[33,50,98],"tardiness":[35,100],"penalties":[36],"per":[37],"unit":[38],"time.":[39],"Each":[40],"induces":[42],"cost":[44],"that":[45,92,172],"proportional":[47],"to":[48,87,162],"tardiness.":[52],"Items":[53],"cut":[54],"the":[56,78,94,129,146,151,154,157,164,180],"same":[57],"bin":[58],"form":[59],"batch,":[61],"whose":[62],"processing":[63],"completion":[65,79],"times":[66],"depend":[67],"on":[68,176],"assigned":[70],"items.":[71],"The":[72,84,159,168],"of":[74,81,97,148],"batch":[76],"have":[77],"time":[80],"their":[82],"bin.":[83],"objective":[85],"find":[88],"cutting":[90],"plan":[91],"minimizes":[93],"weighted":[95,165],"sum":[96],"penalties.":[101,167],"We":[102],"address":[103],"this":[104],"constraint":[108],"programming":[109],"(CP)":[110],"based":[111,117],"heuristic":[112,119],"(CPH)":[113],"an":[115,123],"agent":[116],"modelling":[118],"(ABH).":[120],"CPH":[121,173],"impact-based":[124],"search":[125],"strategy,":[126],"implemented":[127],"in":[128],"general-purpose":[130],"solver":[131],"IBM":[132],"CP":[133],"Optimizer.":[134],"ABH":[135,175],"constructive.":[137],"It":[138],"builds":[139],"solution":[141],"through":[142],"repeated":[143],"negotiations":[144],"between":[145],"set":[147,155],"agents":[149,160],"representing":[150,156],"bins.":[158],"cooperate":[161],"minimize":[163],"earliness-tardiness":[166],"computational":[169],"investigation":[170],"shows":[171],"outperforms":[174],"small-sized":[177],"instances":[178],"while":[179],"opposite":[181],"prevails":[182],"for":[183],"larger":[184],"instances.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}