{"id":"https://openalex.org/W3004128155","doi":"https://doi.org/10.1109/ieem44572.2019.8978674","title":"Optimal Scheduling of the Reentrant Multi-Degree Cyclic Multi-Hoist Scheduing Problem","display_name":"Optimal Scheduling of the Reentrant Multi-Degree Cyclic Multi-Hoist Scheduing Problem","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3004128155","doi":"https://doi.org/10.1109/ieem44572.2019.8978674","mag":"3004128155"},"language":"en","primary_location":{"id":"doi:10.1109/ieem44572.2019.8978674","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem44572.2019.8978674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","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/A5108069508","display_name":"Xin Li","orcid":"https://orcid.org/0000-0002-2469-5420"},"institutions":[{"id":"https://openalex.org/I180726961","display_name":"Shenzhen University","ror":"https://ror.org/01vy4gh70","country_code":"CN","type":"education","lineage":["https://openalex.org/I180726961"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xin Li","raw_affiliation_strings":["College of Management, Shenzhen University, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"College of Management, Shenzhen University, Shenzhen, China","institution_ids":["https://openalex.org/I180726961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090065459","display_name":"Yanchun Pan","orcid":"https://orcid.org/0000-0002-2880-4751"},"institutions":[{"id":"https://openalex.org/I180726961","display_name":"Shenzhen University","ror":"https://ror.org/01vy4gh70","country_code":"CN","type":"education","lineage":["https://openalex.org/I180726961"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanchun Pan","raw_affiliation_strings":["College of Management, Shenzhen University, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"College of Management, Shenzhen University, Shenzhen, China","institution_ids":["https://openalex.org/I180726961"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069721547","display_name":"Richard Y.K. Fung","orcid":"https://orcid.org/0000-0002-3215-1992"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Richard Y. K. Fung","raw_affiliation_strings":["Department of SEEM, City University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of SEEM, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108069508"],"corresponding_institution_ids":["https://openalex.org/I180726961"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25808264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"101","issue":null,"first_page":"1319","last_page":"1323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9972000122070312,"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.9937999844551086,"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/hoist","display_name":"Hoist (device)","score":0.8238389492034912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.633644700050354},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6132254600524902},{"id":"https://openalex.org/keywords/reentrancy","display_name":"Reentrancy","score":0.6010306477546692},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5944753885269165},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5507005453109741},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46858543157577515},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.41984909772872925},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41090840101242065},{"id":"https://openalex.org/keywords/industrial-engineering","display_name":"Industrial engineering","score":0.3597985506057739},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2196839153766632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1804620921611786},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.17331400513648987},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.10436591506004333}],"concepts":[{"id":"https://openalex.org/C149499870","wikidata":"https://www.wikidata.org/wiki/Q1411613","display_name":"Hoist (device)","level":2,"score":0.8238389492034912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.633644700050354},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6132254600524902},{"id":"https://openalex.org/C161406801","wikidata":"https://www.wikidata.org/wiki/Q963635","display_name":"Reentrancy","level":2,"score":0.6010306477546692},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5944753885269165},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5507005453109741},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46858543157577515},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.41984909772872925},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41090840101242065},{"id":"https://openalex.org/C13736549","wikidata":"https://www.wikidata.org/wiki/Q4489420","display_name":"Industrial engineering","level":1,"score":0.3597985506057739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2196839153766632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1804620921611786},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17331400513648987},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.10436591506004333},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ieem44572.2019.8978674","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem44572.2019.8978674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W606103426","https://openalex.org/W1978000533","https://openalex.org/W1995959351","https://openalex.org/W2011851964","https://openalex.org/W2045766182","https://openalex.org/W2078831570","https://openalex.org/W2090083627","https://openalex.org/W2315958334","https://openalex.org/W2523840226"],"related_works":["https://openalex.org/W2992836200","https://openalex.org/W2392092551","https://openalex.org/W2055851110","https://openalex.org/W2146297781","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668"],"abstract_inverted_index":{"The":[0],"current":[1],"paper":[2],"deals":[3],"with":[4,19],"the":[5,39,54,66,69,74,96,119,126,133,136],"cyclic":[6],"multi-hoist":[7],"scheduling":[8],"problem":[9],"in":[10,57,87],"electroplating":[11],"lines":[12],"considering":[13],"rentrance.":[14],"Identical":[15],"parts":[16],"are":[17,46,84,98],"produced":[18],"processing":[20],"time":[21,76],"windows.":[22],"Moreover,":[23],"re-entrance":[24,97],"is":[25,53,110,115,123],"also":[26],"considered.":[27,47],"These":[28],"together":[29],"make":[30],"it":[31],"more":[32],"challenged":[33],"to":[34,64,89,117],"obtain":[35],"better":[36],"schedules":[37],"improving":[38],"productivity.":[40],"To":[41,48],"achieve":[42],"this,":[43],"multi-degree":[44],"cycles":[45],"our":[49],"best":[50],"knowledge,":[51],"this":[52,58],"first":[55,85],"research":[56],"generally":[59],"complicated":[60],"scenario.":[61],"In":[62],"order":[63],"maximize":[65],"productivity":[67],"of":[68,82,135],"production":[70],"line,":[71],"i.e.":[72],"minimize":[73],"cycle":[75],"for":[77],"a":[78,104],"given":[79],"degree,":[80],"operations":[81,94],"hoists":[83],"analyzed":[86],"detail":[88],"avoid":[90],"their":[91],"collision.":[92],"Then,":[93],"related":[95],"modeled.":[99],"Based":[100],"on":[101],"these":[102],"work,":[103],"mixed":[105],"integer":[106],"linear":[107],"programming":[108],"model":[109],"proposed.":[111],"An":[112],"industrial":[113],"instances":[114],"used":[116],"test":[118],"proposed":[120,137],"model.":[121],"It":[122],"solved":[124],"using":[125],"commercial":[127],"software":[128],"ILOG":[129],"CPLEX.":[130],"Results":[131],"illustrate":[132],"efficiency":[134],"approach.":[138]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}