{"id":"https://openalex.org/W2526572902","doi":"https://doi.org/10.15439/2016f447","title":"Minimizing Total Completion Time in Flowshop with Availability Constraint on the First Machine","display_name":"Minimizing Total Completion Time in Flowshop with Availability Constraint on the First Machine","publication_year":2016,"publication_date":"2016-10-02","ids":{"openalex":"https://openalex.org/W2526572902","doi":"https://doi.org/10.15439/2016f447","mag":"2526572902"},"language":"en","primary_location":{"id":"doi:10.15439/2016f447","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2016f447","pdf_url":"https://annals-csis.org/proceedings/2016/pliks/447.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/proceedings/2016/pliks/447.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071513027","display_name":"Hairong Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I117015748","display_name":"Purdue University Northwest","ror":"https://ror.org/04keq6987","country_code":"US","type":"education","lineage":["https://openalex.org/I117015748"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hairong Zhao","raw_affiliation_strings":["Department of Mathematics, Computer Science & Statistics Purdue University Northwest 2200 169th Street, IN 46323, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Computer Science & Statistics Purdue University Northwest 2200 169th Street, IN 46323, USA","institution_ids":["https://openalex.org/I117015748"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055734882","display_name":"Yumei Huo","orcid":"https://orcid.org/0000-0003-3550-8843"},"institutions":[{"id":"https://openalex.org/I142393192","display_name":"College of Staten Island","ror":"https://ror.org/02p179j44","country_code":"US","type":"education","lineage":["https://openalex.org/I142393192"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yumei Huo","raw_affiliation_strings":["Department of Computer Science College of Staten Island, CUNY Staten Island, New York 10314, USA,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science College of Staten Island, CUNY Staten Island, New York 10314, USA,","institution_ids":["https://openalex.org/I142393192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071513027"],"corresponding_institution_ids":["https://openalex.org/I117015748"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12827988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":null,"first_page":"627","last_page":"635"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9952999949455261,"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.9911999702453613,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.656225323677063},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.621427595615387},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43828269839286804},{"id":"https://openalex.org/keywords/industrial-engineering","display_name":"Industrial engineering","score":0.3245924115180969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26323840022087097},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12877774238586426}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.656225323677063},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.621427595615387},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43828269839286804},{"id":"https://openalex.org/C13736549","wikidata":"https://www.wikidata.org/wiki/Q4489420","display_name":"Industrial engineering","level":1,"score":0.3245924115180969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26323840022087097},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12877774238586426},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.15439/2016f447","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2016f447","pdf_url":"https://annals-csis.org/proceedings/2016/pliks/447.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:doaj.org/article:d8ae0669a7a341da97650175185743bf","is_oa":true,"landing_page_url":"https://doaj.org/article/d8ae0669a7a341da97650175185743bf","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annals of computer science and information systems, Vol 8, Pp 627-635 (2016)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.15439/2016f447","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2016f447","pdf_url":"https://annals-csis.org/proceedings/2016/pliks/447.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2526572902.pdf","grobid_xml":"https://content.openalex.org/works/W2526572902.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1570050384","https://openalex.org/W1967955864","https://openalex.org/W1980096819","https://openalex.org/W1994566591","https://openalex.org/W1994970597","https://openalex.org/W1995313677","https://openalex.org/W2015329117","https://openalex.org/W2023170315","https://openalex.org/W2034737492","https://openalex.org/W2053133769","https://openalex.org/W2062366221","https://openalex.org/W2063400071","https://openalex.org/W2063552989","https://openalex.org/W2065819816","https://openalex.org/W2071126781","https://openalex.org/W2086748991","https://openalex.org/W2140447370","https://openalex.org/W2157846217","https://openalex.org/W2160424269","https://openalex.org/W2334211539"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2349580982"],"abstract_inverted_index":{"We":[0,66,83,121,136],"study":[1,138],"the":[2,20,41,51,59,69,79,100,123,130,140,144,147,151,154],"problem":[3,16],"of":[4,36,125,146,153],"minimizing":[5],"total":[6,52],"completion":[7,53],"time":[8,54,142],"in":[9,19],"2-stage":[10],"flowshop":[11],"with":[12],"availability":[13,31],"constraint.":[14],"This":[15,56],"is":[17,46,58,73],"NP-hard":[18],"strong":[21],"sense":[22],"even":[23],"if":[24],"both":[25],"machines":[26],"are":[27],"always":[28],"available.":[29],"With":[30],"constraint,":[32],"although":[33],"a":[34,74,96,116],"bulk":[35],"research":[37,48],"papers":[38],"have":[39],"studied":[40],"makespan":[42],"minimization":[43],"problem,":[44],"there":[45,72],"no":[47],"done":[49],"on":[50,68,78],"minimization.":[55],"paper":[57],"first":[60,80],"attempt":[61],"to":[62],"tackle":[63],"this":[64],"problem.":[65],"focus":[67],"case":[70],"that":[71,85],"single":[75],"unavailable":[76,148],"interval":[77,149],"machine":[81],"only.":[82],"show":[84],"several":[86],"special":[87],"cases":[88],"can":[89],"be":[90],"solved":[91],"optimally":[92],"or":[93],"approximated":[94],"within":[95],"constant":[97],"factor.":[98],"For":[99],"general":[101],"case,":[102],"we":[103,112],"develop":[104],"some":[105],"lower":[106,127],"bounds":[107,128],"and":[108,114,118,129,143,156],"dominance":[109,131],"rules.":[110],"Then":[111],"design":[113],"implement":[115],"branch":[117,155],"bound":[119,157],"algorithm.":[120,158],"investigate":[122],"effectiveness":[124],"different":[126],"rules":[132],"by":[133],"computational":[134],"experiments.":[135],"also":[137],"how":[139],"start":[141],"duration":[145],"affects":[150],"efficiency":[152]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}