{"id":"https://openalex.org/W2141124099","doi":"https://doi.org/10.1109/robot.2004.1307544","title":"Solving the FMS scheduling problem by critical ratio-based heuristics and the genetic algorithm","display_name":"Solving the FMS scheduling problem by critical ratio-based heuristics and the genetic algorithm","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2141124099","doi":"https://doi.org/10.1109/robot.2004.1307544","mag":"2141124099"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2004.1307544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1307544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","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/A5069510989","display_name":"Tsung-Che Chiang","orcid":"https://orcid.org/0000-0001-8253-795X"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tsung-Che Chiang","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan","[dept. of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"[dept. of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan]","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101925654","display_name":"Li\u2010Chen Fu","orcid":"https://orcid.org/0000-0002-6947-7646"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Li-Chen Fu","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan","[dept. of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"[dept. of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan]","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16733864"],"apc_list":null,"apc_paid":null,"fwci":3.5895,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.93383312,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3131","last_page":"3136 Vol.3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9868000149726868,"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.9851999878883362,"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.7149940729141235},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6509575843811035},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.57575523853302},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.542183518409729},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.531950056552887},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5318690538406372},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.47330179810523987},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.47253111004829407},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.46991080045700073},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44700881838798523},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.41499263048171997},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40900522470474243},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3979893922805786},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2786335051059723},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1753915548324585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11061403155326843}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7149940729141235},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6509575843811035},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.57575523853302},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.542183518409729},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.531950056552887},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5318690538406372},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.47330179810523987},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.47253111004829407},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.46991080045700073},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44700881838798523},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.41499263048171997},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40900522470474243},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3979893922805786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2786335051059723},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1753915548324585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11061403155326843},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/robot.2004.1307544","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1307544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.612.603","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.612.603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://gra103.aca.ntu.edu.tw/gdoc/93/d90922009a.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1954965455","https://openalex.org/W2096863180","https://openalex.org/W2109473464","https://openalex.org/W2114494464","https://openalex.org/W2121379994","https://openalex.org/W2123161631","https://openalex.org/W2125367223","https://openalex.org/W2129745344","https://openalex.org/W2137333349","https://openalex.org/W2142284119","https://openalex.org/W2155966686","https://openalex.org/W2159164010","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2372008037","https://openalex.org/W3036719625","https://openalex.org/W2225350526","https://openalex.org/W2978148977","https://openalex.org/W2949165180","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2384952691"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,13,41,57,65,70,75,84,94],"FMS":[4],"scheduling":[5,59],"problem.":[6,33],"The":[7,16],"objective":[8],"concerned":[9],"here":[10],"is":[11,78],"maximizing":[12],"meet-due-date":[14],"rate.":[15],"authors":[17],"propose":[18,49],"two":[19,27,35],"rules":[20,36,96],"for":[21],"job":[22,25,72],"sequencing":[23,73],"and":[24,97],"dispatching,":[26],"common":[28],"subtasks":[29],"in":[30],"solving":[31],"this":[32],"These":[34],"are":[37,99],"designed":[38,79],"based":[39],"on":[40],"critical":[42],"ratio":[43],"values":[44],"of":[45,67,69],"jobs.":[46],"We":[47],"also":[48,88],"a":[50],"mechanism":[51],"to":[52,82,89],"obtain":[53],"better":[54],"performance":[55],"than":[56],"stand-alone":[58],"process":[60],"via":[61],"genetic":[62,76],"algorithms.":[63],"With":[64],"nature":[66],"design":[68],"proposed":[71,95],"rule,":[74],"algorithm":[77],"not":[80],"only":[81],"improve":[83],"schedule":[85],"quality":[86],"but":[87],"save":[90],"computation":[91],"time.":[92],"All":[93],"idea":[98],"carefully":[100],"examined":[101],"through":[102],"several":[103],"different":[104],"scenarios.":[105]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}