{"id":"https://openalex.org/W2431199330","doi":"https://doi.org/10.1109/wodes.2016.7497827","title":"Comparing MILP, CP, and A* for multiple stacker crane scheduling","display_name":"Comparing MILP, CP, and A* for multiple stacker crane scheduling","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2431199330","doi":"https://doi.org/10.1109/wodes.2016.7497827","mag":"2431199330"},"language":"en","primary_location":{"id":"doi:10.1109/wodes.2016.7497827","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wodes.2016.7497827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 13th International Workshop on Discrete Event Systems (WODES)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027294250","display_name":"Fredrik Hagebring","orcid":"https://orcid.org/0000-0002-1801-1969"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Fredrik Hagebring","raw_affiliation_strings":["Department of Signals and Systems, Chalmers University of Technology, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036504431","display_name":"Oskar Wigstr\u00f6m","orcid":"https://orcid.org/0000-0002-5881-2226"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Oskar Wigstrom","raw_affiliation_strings":["Department of Signals and Systems, Chalmers University of Technology, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076331540","display_name":"Bengt Lennartson","orcid":"https://orcid.org/0000-0002-3406-3881"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt Lennartson","raw_affiliation_strings":["Department of Signals and Systems, Chalmers University of Technology, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103878937","display_name":"Simon I. Ware","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Simon Ian Ware","raw_affiliation_strings":["School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore 639798"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore 639798","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046844818","display_name":"Rong Su","orcid":"https://orcid.org/0000-0003-3448-0586"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Rong Su","raw_affiliation_strings":["School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore 639798"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore 639798","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5909,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72106934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"63","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9695000052452087,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9514999985694885,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stacker","display_name":"Stacker","score":0.7706433534622192},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7303172945976257},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6770206093788147},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5581865906715393},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5553793907165527},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5468522906303406},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5448224544525146},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.5359099507331848},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4988536834716797},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46857380867004395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29625189304351807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20515650510787964},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.13522738218307495},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07410401105880737}],"concepts":[{"id":"https://openalex.org/C2777740907","wikidata":"https://www.wikidata.org/wiki/Q332280","display_name":"Stacker","level":2,"score":0.7706433534622192},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7303172945976257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6770206093788147},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5581865906715393},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5553793907165527},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5468522906303406},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5448224544525146},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.5359099507331848},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4988536834716797},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46857380867004395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29625189304351807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20515650510787964},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.13522738218307495},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07410401105880737},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/wodes.2016.7497827","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wodes.2016.7497827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 13th International Workshop on Discrete Event Systems (WODES)","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.lib.chalmers.se:243392","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/243392-comparing-milp-cp-and-a-for-multiple-stacker-crane-scheduling","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:243392","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/243392","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W47957325","https://openalex.org/W116698759","https://openalex.org/W1733489975","https://openalex.org/W2054168093","https://openalex.org/W2134098988","https://openalex.org/W2166928920","https://openalex.org/W6601945944"],"related_works":["https://openalex.org/W2375294040","https://openalex.org/W2118673613","https://openalex.org/W2370392548","https://openalex.org/W2374327645","https://openalex.org/W2381262500","https://openalex.org/W2362146220","https://openalex.org/W4282918333","https://openalex.org/W2937685542","https://openalex.org/W2321371676","https://openalex.org/W2147600044"],"abstract_inverted_index":{"This":[0,56],"paper":[1,95,165],"describes":[2],"an":[3],"optimisation":[4],"model":[5,37,57],"for":[6],"the":[7,21,26,29,36,46,49,82,126,144,150,153,159,204],"scheduling":[8],"of":[9,13,28,35,48,128,134,143,152,206],"a":[10,32,42],"system":[11],"consisting":[12],"three":[14],"stacker":[15],"cranes":[16],"that":[17,97,168,197],"are":[18,74,137,158],"restricted":[19],"to":[20,61,139,146],"same":[22],"track.":[23],"To":[24,148],"improve":[25],"efficiency":[27],"solution":[30,50,65,99,156,205],"methods,":[31,66],"novel":[33],"simplification":[34],"is":[38,58,109],"presented,":[39],"which":[40],"has":[41],"low":[43],"impact":[44],"on":[45,76,112,191],"quality":[47],"but":[51],"greatly":[52],"decreases":[53],"its":[54],"complexity.":[55],"then":[59],"used":[60],"benchmark":[62],"several":[63],"popular":[64],"including":[67],"both":[68],"optimal":[69],"and":[70,104,186],"approximate":[71,155],"methods.":[72],"Some":[73],"based":[75],"monolithic":[77],"models,":[78],"whereas":[79],"others":[80],"solve":[81,140],"problem":[83,145,209],"in":[84,93],"phases":[85],"by":[86],"using":[87,178],"sub-problem":[88],"formulations.":[89],"The":[90],"result":[91],"presented":[92],"this":[94,164],"shows":[96],"evaluated":[98],"methods":[100,136,157,177],"have":[101],"complementary":[102],"strengths":[103],"weaknesses.":[105],"Constraint":[106],"Programming":[107,120],"(CP)":[108],"very":[110,207],"efficient":[111],"small":[113],"scale":[114],"problems,":[115],"while":[116],"Mixed":[117],"Integer":[118],"Linear":[119],"(MILP)":[121],"scales":[122],"much":[123],"better":[124],"when":[125],"number":[127],"movement":[129],"orders":[130],"increases.":[131],"However,":[132,188],"none":[133],"these":[135],"able":[138],"large":[141,208],"instances":[142],"optimality.":[147],"handle":[149],"complexity":[151],"problem,":[154],"only":[160],"viable":[161],"option.":[162],"In":[163],"we":[166],"show":[167,196],"promising":[169],"results":[170,190],"can":[171],"be":[172,201],"obtained":[173],"even":[174],"with":[175],"simple":[176],"well":[179],"known":[180],"search":[181,194],"algorithms":[182,195],"such":[183],"as":[184],"A*":[185],"Tabu-search.":[187],"preliminary":[189],"more":[192],"advanced":[193],"further":[198],"improvements":[199],"may":[200],"achieved,":[202],"allowing":[203],"instances.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}