{"id":"https://openalex.org/W3004255314","doi":"https://doi.org/10.1109/ieem44572.2019.8978728","title":"An Integrated Two-Stage Optimization Method for Job-Shop Bottleneck Planning and Scheduling","display_name":"An Integrated Two-Stage Optimization Method for Job-Shop Bottleneck Planning and Scheduling","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3004255314","doi":"https://doi.org/10.1109/ieem44572.2019.8978728","mag":"3004255314"},"language":"en","primary_location":{"id":"doi:10.1109/ieem44572.2019.8978728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem44572.2019.8978728","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":"conference-paper","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/A5101697956","display_name":"Na Gao","orcid":"https://orcid.org/0000-0002-5071-965X"},"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":"Na Gao","raw_affiliation_strings":["School of Mechanical and Aerospace Engineering, Nanyang Technological University,Singapore","School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Nanyang Technological University,Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082988770","display_name":"Seung Ki Moon","orcid":"https://orcid.org/0000-0002-2249-7500"},"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":"Seung Ki Moon","raw_affiliation_strings":["School of Mechanical and Aerospace Engineering, Nanyang Technological University,Singapore","School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Nanyang Technological University,Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"855","last_page":"859"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9919000267982483,"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.9909999966621399,"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/computer-science","display_name":"Computer science","score":0.708600640296936},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6564698815345764},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.638838529586792},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6180053353309631},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5889120101928711},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5857367515563965},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5805032253265381},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5791477560997009},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5651508569717407},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5126280188560486},{"id":"https://openalex.org/keywords/nurse-scheduling-problem","display_name":"Nurse scheduling problem","score":0.49557173252105713},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4764400124549866},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.4583098888397217},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.347159206867218},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.14401239156723022},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12836980819702148}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.708600640296936},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6564698815345764},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.638838529586792},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6180053353309631},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5889120101928711},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5857367515563965},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5805032253265381},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5791477560997009},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5651508569717407},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5126280188560486},{"id":"https://openalex.org/C102370290","wikidata":"https://www.wikidata.org/wiki/Q7070210","display_name":"Nurse scheduling problem","level":5,"score":0.49557173252105713},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4764400124549866},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.4583098888397217},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.347159206867218},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.14401239156723022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12836980819702148},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ieem44572.2019.8978728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem44572.2019.8978728","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":[{"id":"https://metadata.un.org/sdg/8","score":0.5600000023841858,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W163468006","https://openalex.org/W1167386377","https://openalex.org/W1970867026","https://openalex.org/W2010208127","https://openalex.org/W2024966195","https://openalex.org/W2240283719","https://openalex.org/W2512395380","https://openalex.org/W2518264398","https://openalex.org/W2738101055","https://openalex.org/W2745636372","https://openalex.org/W2803412322","https://openalex.org/W2806321303","https://openalex.org/W2808701618","https://openalex.org/W2957456999","https://openalex.org/W6752291251"],"related_works":["https://openalex.org/W2155809154","https://openalex.org/W2949165180","https://openalex.org/W2807934311","https://openalex.org/W2741059494","https://openalex.org/W2365679959","https://openalex.org/W131757205","https://openalex.org/W2057737420","https://openalex.org/W2596081411","https://openalex.org/W3041148412","https://openalex.org/W4322100529"],"abstract_inverted_index":{"In":[0],"many":[1],"literatures,":[2],"planning":[3,45,108],"and":[4,30,43,46,63,109],"scheduling":[5,15,47,52,110],"problems":[6,77],"have":[7],"been":[8],"considered":[9],"separately.":[10],"Furthermore,":[11],"resource":[12],"constraints":[13],"for":[14,20,102],"are":[16,23,92],"not":[17],"only":[18],"relevant":[19],"equipment,":[21],"but":[22],"also":[24],"strongly":[25],"affected":[26],"by":[27,78],"second":[28],"resources":[29],"set":[31,65],"up":[32],"conversions.":[33],"This":[34],"paper":[35],"derives":[36],"how":[37],"constraint":[38],"programming":[39],"enables":[40],"problem-dependent":[41],"specialization":[42],"increases":[44],"efficiency.":[48],"Constraint":[49],"programing":[50],"based":[51],"involves":[53],"multi-resources":[54],"capacity":[55],"limit,":[56],"demand":[57],"fulfill,":[58],"precedence,":[59],"initialization,":[60],"down":[61],"activities":[62],"sequence-dependent":[64],"up.":[66],"Then,":[67],"we":[68],"improve":[69],"this":[70],"model":[71],"to":[72,84,94],"address":[73],"on":[74],"more":[75],"complex":[76],"introducing":[79],"a":[80,103],"two-stage":[81],"optimization":[82],"method":[83,101],"decrease":[85],"the":[86,96,99],"computational":[87,90],"burden.":[88],"Finally,":[89],"results":[91],"demonstrated":[93],"show":[95],"efficiency":[97],"of":[98],"proposed":[100],"real":[104],"time":[105],"large":[106],"scale":[107],"problem.":[111]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}