{"id":"https://openalex.org/W3103543369","doi":"https://doi.org/10.1007/s10601-020-09316-z","title":"A new constraint programming model and solving for the cyclic hoist scheduling problem","display_name":"A new constraint programming model and solving for the cyclic hoist scheduling problem","publication_year":2020,"publication_date":"2020-11-09","ids":{"openalex":"https://openalex.org/W3103543369","doi":"https://doi.org/10.1007/s10601-020-09316-z","mag":"3103543369"},"language":"en","primary_location":{"id":"doi:10.1007/s10601-020-09316-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10601-020-09316-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10601-020-09316-z.pdf","source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Constraints","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10601-020-09316-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013174025","display_name":"Mark Wallace","orcid":"https://orcid.org/0000-0001-7326-8110"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mark Wallace","raw_affiliation_strings":["Monash University, Melbourne, Australia"],"raw_orcid":"https://orcid.org/0000-0001-7326-8110","affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006046553","display_name":"Neil Yorke\u2010Smith","orcid":"https://orcid.org/0000-0002-1814-3515"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Neil Yorke-Smith","raw_affiliation_strings":["Delft University of Technology, Delft, Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1814-3515","affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006046553"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.9389,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78164774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"25","issue":"3-4","first_page":"319","last_page":"337"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"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.9993000030517578,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.996399998664856,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9908000230789185,"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/computer-science","display_name":"Computer science","score":0.6962074637413025},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6948930025100708},{"id":"https://openalex.org/keywords/hoist","display_name":"Hoist (device)","score":0.6379938721656799},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5738752484321594},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5271682143211365},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5040027499198914},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.41466575860977173},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.310976505279541},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2467942237854004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17076876759529114},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07682180404663086},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.07654616236686707}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6962074637413025},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6948930025100708},{"id":"https://openalex.org/C149499870","wikidata":"https://www.wikidata.org/wiki/Q1411613","display_name":"Hoist (device)","level":2,"score":0.6379938721656799},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5738752484321594},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5271682143211365},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5040027499198914},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.41466575860977173},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.310976505279541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2467942237854004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17076876759529114},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07682180404663086},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.07654616236686707},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10601-020-09316-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10601-020-09316-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10601-020-09316-z.pdf","source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Constraints","raw_type":"journal-article"},{"id":"pmh:oai:monash.edu:openaire/27b6b222-a730-47ee-95fb-e41d39aa6e42","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/27b6b222-a730-47ee-95fb-e41d39aa6e42","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wallace, M & Yorke-Smith, N 2020, 'A new constraint programming model and solving for the cyclic hoist scheduling problem', Constraints, vol. 25, pp. 319\u2013337. https://doi.org/10.1007/s10601-020-09316-z","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:monash.edu:publications/27b6b222-a730-47ee-95fb-e41d39aa6e42","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85095681857&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wallace , M & Yorke-Smith , N 2020 , ' A new constraint programming model and solving for the cyclic hoist scheduling problem ' , Constraints , vol. 25 , pp. 319\u2013337 . https://doi.org/10.1007/s10601-020-09316-z","raw_type":"article"},{"id":"pmh:oai:tudelft.nl:uuid:3c211973-2391-4411-b84c-f99b176054e3","is_oa":true,"landing_page_url":"http://resolver.tudelft.nl/uuid:3c211973-2391-4411-b84c-f99b176054e3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"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":"journal article"},{"id":"pmh:oai:tudelft.nl:uuid:8cb61bf0-d3c7-4a75-b978-294db6367896","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:8cb61bf0-d3c7-4a75-b978-294db6367896","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"abstract"}],"best_oa_location":{"id":"doi:10.1007/s10601-020-09316-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10601-020-09316-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10601-020-09316-z.pdf","source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Constraints","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3103543369.pdf","grobid_xml":"https://content.openalex.org/works/W3103543369.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1560957333","https://openalex.org/W1884966213","https://openalex.org/W1979192552","https://openalex.org/W1979506464","https://openalex.org/W2002556739","https://openalex.org/W2048928932","https://openalex.org/W2072406267","https://openalex.org/W2094603448","https://openalex.org/W2109984026","https://openalex.org/W2147965468","https://openalex.org/W2159875930","https://openalex.org/W2169437757","https://openalex.org/W2315958334","https://openalex.org/W2397212977","https://openalex.org/W2439572525","https://openalex.org/W2510061404","https://openalex.org/W2513901659","https://openalex.org/W2765344493","https://openalex.org/W2799894749","https://openalex.org/W2963477769","https://openalex.org/W2963740396"],"related_works":["https://openalex.org/W1551947503","https://openalex.org/W1531664660","https://openalex.org/W200657494","https://openalex.org/W1483147174","https://openalex.org/W1980681296","https://openalex.org/W2175178858","https://openalex.org/W2020731817","https://openalex.org/W60637586","https://openalex.org/W2495969191","https://openalex.org/W1548409801"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"cyclic":[2],"hoist":[3],"scheduling":[4],"problem":[5,11,47],"(CHSP)":[6],"is":[7],"a":[8,58,79,87],"well-studied":[9],"optimisation":[10],"due":[12],"to":[13,26,42,85,92,122],"its":[14,30],"importance":[15],"in":[16,78],"industry.":[17],"Despite":[18],"the":[19,27,32,54,97,100,114],"wide":[20],"range":[21],"of":[22,53,99,117],"solving":[23,69,126],"techniques":[24],"applied":[25],"CHSP":[28,55],"and":[29,37,56,74,91,109],"variants,":[31],"models":[33],"have":[34,40],"remained":[35],"complicated":[36],"inflexible,":[38],"or":[39],"failed":[41],"scale":[43],"up":[44],"with":[45],"larger":[46],"instances.":[48],"This":[49],"article":[50],"re-examines":[51],"modelling":[52,77],"proposes":[57],"new":[59],"simple,":[60,88],"flexible":[61],"constraint":[62,81],"programming":[63,108],"formulation.":[64],"We":[65,102],"compare":[66],"current":[67],"state-of-the-art":[68],"technologies":[70],"on":[71],"this":[72],"formulation,":[73],"show":[75],"that":[76,95,105],"high-level":[80],"language,":[82],"MiniZinc,":[83],"leads":[84],"both":[86],"generic":[89],"model":[90],"computational":[93],"results":[94],"outperform":[96],"state":[98],"art.":[101],"further":[103],"demonstrate":[104],"combining":[106],"integer":[107],"lazy":[110],"clause":[111],"generation,":[112],"using":[113],"multiple":[115],"cores":[116],"modern":[118],"processors,":[119],"has":[120],"potential":[121],"improve":[123],"over":[124],"either":[125],"approach":[127],"alone.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}