{"id":"https://openalex.org/W2127797629","doi":"https://doi.org/10.1109/tai.2003.1250190","title":"Fragmental optimization on the 2-machine bicriteria flowshop scheduling problem","display_name":"Fragmental optimization on the 2-machine bicriteria flowshop scheduling problem","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2127797629","doi":"https://doi.org/10.1109/tai.2003.1250190","mag":"2127797629"},"language":"en","primary_location":{"id":"doi:10.1109/tai.2003.1250190","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tai.2003.1250190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","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/A5079719314","display_name":"Gaofeng Huang","orcid":"https://orcid.org/0009-0009-3837-4650"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Gaofeng Huang","raw_affiliation_strings":["Department of Computer Science, National University of Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102741528","display_name":"Andrew Lim","orcid":"https://orcid.org/0000-0003-0510-8080"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"A. Lim","raw_affiliation_strings":["Department of IEEM, Hong Kong University of Science and Technology, Kowloon, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of IEEM, Hong Kong University of Science and Technology, Kowloon, Hong Kong, China","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079719314"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.20795831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"194","last_page":"194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9922000169754028,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9918000102043152,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7969601154327393},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.77784264087677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6831008195877075},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6785755753517151},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5747453570365906},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5445899367332458},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.43974852561950684},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4200925827026367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36408090591430664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24100670218467712}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7969601154327393},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.77784264087677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6831008195877075},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6785755753517151},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5747453570365906},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5445899367332458},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.43974852561950684},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4200925827026367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36408090591430664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24100670218467712},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tai.2003.1250190","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tai.2003.1250190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1548540712","https://openalex.org/W1981288217","https://openalex.org/W1997363303","https://openalex.org/W2024085737","https://openalex.org/W2059586194","https://openalex.org/W2065163424","https://openalex.org/W2072187533","https://openalex.org/W2095303169","https://openalex.org/W4236295709"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2007032764","https://openalex.org/W2955323683","https://openalex.org/W803550684","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2483226803"],"abstract_inverted_index":{"The":[0],"2-machine":[1],"bicriteria":[2],"flowshop":[3],"scheduling":[4],"problem":[5,32],"F2/spl":[6],"par/(/spl":[7],"Sigma/C/sub":[8],"i//C/sub":[9],"max/)":[10],"is":[11,33],"studied":[12],"in":[13],"this":[14,50],"paper,":[15,51],"which":[16,57],"minimizes":[17],"the":[18,24,27,65,90],"total":[19],"flow":[20],"time":[21],"subject":[22],"to":[23,35,46,89],"makespan":[25],"of":[26],"schedule":[28],"being":[29],"minimum.":[30],"This":[31],"known":[34],"be":[36],"strongly":[37],"NP-hard,":[38],"and":[39,68,82],"several":[40],"heuristic":[41],"algorithms":[42],"have":[43],"been":[44],"proposed":[45],"solve":[47],"it.":[48],"In":[49],"we":[52,58],"present":[53],"a":[54],"new":[55],"approach,":[56],"named":[59],"fragmental":[60],"optimization":[61],"(FO),":[62],"that":[63,75,85],"combines":[64],"dynamic":[66],"programming":[67],"local":[69],"search":[70],"strategies.":[71],"Extensive":[72],"experimentation":[73],"shows":[74],"our":[76],"FO":[77],"algorithm":[78],"outperforms":[79],"existing":[80],"heuristics":[81],"provides":[83],"solutions":[84],"are":[86],"very":[87],"close":[88],"optimal.":[91]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}