{"id":"https://openalex.org/W2165861840","doi":"https://doi.org/10.1142/s1793830909000129","title":"MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS","display_name":"MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2165861840","doi":"https://doi.org/10.1142/s1793830909000129","mag":"2165861840"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830909000129","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000129","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5090514819","display_name":"Bin Fu","orcid":"https://orcid.org/0000-0003-4899-8837"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"BIN FU","raw_affiliation_strings":["Department of Computer Science, University of Texas\u2013Pan American, Edinburg, TX 78539, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas\u2013Pan American, Edinburg, TX 78539, USA","institution_ids":[]}]},{"author_position":"middle","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"]}]},{"author_position":"last","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":false,"raw_author_name":"HAIRONG ZHAO","raw_affiliation_strings":["Department of Mathematics, Computer Science & Statistics, Purdue University Calumet, Hammond, IN 46323, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Computer Science & Statistics, Purdue University Calumet, Hammond, IN 46323, USA","institution_ids":["https://openalex.org/I117015748"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090514819"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5007,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.86887697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"01","issue":"02","first_page":"141","last_page":"151"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9966999888420105,"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/unavailability","display_name":"Unavailability","score":0.941224217414856},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7968975901603699},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.620861828327179},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6160321235656738},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6156880259513855},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5672524571418762},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5531031489372253},{"id":"https://openalex.org/keywords/preventive-maintenance","display_name":"Preventive maintenance","score":0.5410285592079163},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.535921573638916},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5323436856269836},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.527294397354126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5047739744186401},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4905676245689392},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4813055098056793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38334324955940247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27888065576553345},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.266569048166275},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11200830340385437}],"concepts":[{"id":"https://openalex.org/C2780505938","wikidata":"https://www.wikidata.org/wiki/Q17093282","display_name":"Unavailability","level":2,"score":0.941224217414856},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7968975901603699},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.620861828327179},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6160321235656738},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6156880259513855},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5672524571418762},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5531031489372253},{"id":"https://openalex.org/C24090081","wikidata":"https://www.wikidata.org/wiki/Q1043452","display_name":"Preventive maintenance","level":2,"score":0.5410285592079163},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.535921573638916},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5323436856269836},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.527294397354126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5047739744186401},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4905676245689392},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4813055098056793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38334324955940247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27888065576553345},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.266569048166275},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11200830340385437},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C200601418","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability engineering","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830909000129","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000129","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.550000011920929,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1981992833","https://openalex.org/W1990489976","https://openalex.org/W1994566591","https://openalex.org/W1995313677","https://openalex.org/W2011039300","https://openalex.org/W2016722510","https://openalex.org/W2030182609","https://openalex.org/W2033861214","https://openalex.org/W2048135710","https://openalex.org/W2065038227","https://openalex.org/W2065819816","https://openalex.org/W2066241012","https://openalex.org/W2066848916","https://openalex.org/W2077711297","https://openalex.org/W2078969146","https://openalex.org/W2093979815","https://openalex.org/W2126552958","https://openalex.org/W2138979525"],"related_works":["https://openalex.org/W2946731255","https://openalex.org/W3202300193","https://openalex.org/W4291000449","https://openalex.org/W1147962567","https://openalex.org/W2085977800","https://openalex.org/W2033593699","https://openalex.org/W2587727662","https://openalex.org/W2241208925","https://openalex.org/W2970302286","https://openalex.org/W2810352541"],"abstract_inverted_index":{"We":[0,14,70],"investigate":[1],"the":[2,22,26,35,40,51,63,68,84,92,107,122,174],"problems":[3],"of":[4,19,48,50,155,178],"scheduling":[5],"n":[6,52],"jobs":[7,53,180],"to":[8,30,44,54,66,135],"m":[9,73],"machines":[10,56,153],"with":[11,160],"availability":[12,20],"constraints.":[13],"consider":[15],"two":[16],"different":[17],"models":[18],"constraints:":[21],"preventive":[23,31,108],"model":[24,38],"where":[25,39,170],"unavailability":[27,41],"is":[28,42,65,74,81,103,118,173],"due":[29,43],"machine":[32,93,117,141],"maintenance,":[33],"and":[34,77,181],"fixed":[36,97],"job":[37,80,98],"a":[45,75,79,137,191],"priori":[46],"assignment":[47],"some":[49,143],"certain":[55,58],"at":[57,114],"times.":[59],"In":[60],"both":[61],"models,":[62],"objective":[64],"minimize":[67],"makespan.":[69],"assume":[71],"that":[72,112,148,209],"constant,":[76],"if":[78,113,149],"interrupted":[82],"by":[83,130,164],"unavailable":[85,144,158],"interval,":[86],"it":[87],"can":[88,132,183,189],"be":[89,133,184],"resumed":[90],"after":[91],"becomes":[94],"available.":[95],"For":[96,106],"model,":[99,109],"we":[100,110,146,188,207],"show":[101,111,147,208],"there":[102,210],"an":[104],"FPTAS.":[105],"least":[115],"one":[116],"always":[119],"available,":[120],"then":[121],"PTAS":[123],"for":[124,198],"Multiple":[125],"Subset":[126],"Sum":[127],"problem":[128],"given":[129],"Kellerer":[131],"applied":[134],"get":[136],"PTAS;":[138],"otherwise,":[139],"every":[140],"has":[142,157],"intervals,":[145],"(m":[150],"-":[151,220],"1)":[152],"each":[154],"which":[156],"intervals":[159],"total":[161,175],"length":[162],"bounded":[163],"\u03b1(n)":[165,182,194,219],"\u00b7":[166],"P":[167,171,223],"sum":[168,172],"/m":[169],"processing":[176],"time":[177,216],"all":[179],"any":[185,199,214],"non-negative":[186],"function,":[187],"develop":[190],"(1":[192,217],"+":[193,195,218],"\u220a)-approximation":[196],"algorithm":[197],"constant":[200],"0":[201],"<":[202,204],"\u220a":[203],"1;":[205],"further":[206],"does":[211],"not":[212],"exist":[213],"polynomial":[215],"o(1))-approximation":[221],"unless":[222],"=":[224],"NP.":[225]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}