{"id":"https://openalex.org/W2071522356","doi":"https://doi.org/10.1080/09511920701575088","title":"Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic","display_name":"Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic","publication_year":2008,"publication_date":"2008-05-12","ids":{"openalex":"https://openalex.org/W2071522356","doi":"https://doi.org/10.1080/09511920701575088","mag":"2071522356"},"language":"en","primary_location":{"id":"doi:10.1080/09511920701575088","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09511920701575088","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","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/A5075247612","display_name":"Imed Kacem","orcid":"https://orcid.org/0000-0001-6649-7257"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Imed Kacem","raw_affiliation_strings":["Institut Charles Delaunay, CNRS FRE 2848, Laboratoire d'Optimisation des Syst\u00e8mes Industriels, Universit\u00e9 de Technologie de Troyes , 12 rue Marie Curie, B.P. 2060, Troyes, 10010, France","Institut Charles Delaunay, CNRS FRE 2848, Laboratoire d'Optimisation des Systemes Industriels, Universite de Technologie de Troyes, Troyes, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut Charles Delaunay, CNRS FRE 2848, Laboratoire d'Optimisation des Syst\u00e8mes Industriels, Universit\u00e9 de Technologie de Troyes , 12 rue Marie Curie, B.P. 2060, Troyes, 10010, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I140494188"]},{"raw_affiliation_string":"Institut Charles Delaunay, CNRS FRE 2848, Laboratoire d'Optimisation des Systemes Industriels, Universite de Technologie de Troyes, Troyes, France#TAB#","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I140494188"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100741513","display_name":"Chengbin Chu","orcid":"https://orcid.org/0000-0002-1837-4380"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Chengbin Chu","raw_affiliation_strings":["Institut Charles Delaunay, CNRS FRE 2848, Laboratoire d'Optimisation des Syst\u00e8mes Industriels, Universit\u00e9 de Technologie de Troyes , 12 rue Marie Curie, B.P. 2060, Troyes, 10010, France","Institut Charles Delaunay, CNRS FRE 2848, Laboratoire d'Optimisation des Systemes Industriels, Universite de Technologie de Troyes, Troyes, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut Charles Delaunay, CNRS FRE 2848, Laboratoire d'Optimisation des Syst\u00e8mes Industriels, Universit\u00e9 de Technologie de Troyes , 12 rue Marie Curie, B.P. 2060, Troyes, 10010, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I140494188"]},{"raw_affiliation_string":"Institut Charles Delaunay, CNRS FRE 2848, Laboratoire d'Optimisation des Systemes Industriels, Universite de Technologie de Troyes, Troyes, France#TAB#","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I140494188"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075247612"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I140494188"],"apc_list":null,"apc_paid":null,"fwci":1.5417,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85565716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"21","issue":"4","first_page":"388","last_page":"395"},"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.9958999752998352,"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.992900013923645,"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/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.723962128162384},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6582896709442139},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6353289484977722},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5970913171768188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5889768600463867},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5778681039810181},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5146637558937073},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.465424507856369},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.43979716300964355},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.38065105676651},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3427150249481201},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30776503682136536},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.0827505886554718}],"concepts":[{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.723962128162384},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6582896709442139},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6353289484977722},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5970913171768188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5889768600463867},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5778681039810181},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5146637558937073},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.465424507856369},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.43979716300964355},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.38065105676651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3427150249481201},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30776503682136536},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0827505886554718},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/09511920701575088","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09511920701575088","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04001225v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04001225","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computer Integrated Manufacturing, 2008, 21 (4), pp.388-395. ⟨10.1080/09511920701575088⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1501066815","https://openalex.org/W1975363439","https://openalex.org/W1980015951","https://openalex.org/W1980096819","https://openalex.org/W1987777883","https://openalex.org/W1994429799","https://openalex.org/W1994566591","https://openalex.org/W1995313677","https://openalex.org/W1996857262","https://openalex.org/W1997449826","https://openalex.org/W2007919031","https://openalex.org/W2015718430","https://openalex.org/W2030047611","https://openalex.org/W2036301822","https://openalex.org/W2036466874","https://openalex.org/W2036497325","https://openalex.org/W2040303793","https://openalex.org/W2041682173","https://openalex.org/W2045895304","https://openalex.org/W2048690484","https://openalex.org/W2049948201","https://openalex.org/W2079978613","https://openalex.org/W2084907162","https://openalex.org/W2090205685","https://openalex.org/W2093961153","https://openalex.org/W3023136106","https://openalex.org/W4244592547"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W1974309933","https://openalex.org/W2092240563","https://openalex.org/W2094800167","https://openalex.org/W2898780166","https://openalex.org/W1908901187","https://openalex.org/W2383692867","https://openalex.org/W2391709653","https://openalex.org/W2963437911"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,54],"study":[4],"the":[5,11,15,29,37,41,50,57,71],"single":[6],"machine":[7,20],"scheduling":[8,78],"problem":[9],"with":[10,79],"aim":[12],"of":[13,36,40,49,74],"minimizing":[14],"weighted":[16],"flow":[17],"time.":[18],"The":[19,67],"is":[21,60],"unavailable":[22],"during":[23],"a":[24,46],"given":[25],"period.":[26],"We":[27,32,44],"consider":[28],"resumable":[30],"case.":[31],"propose":[33],"new":[34],"properties":[35],"worst-case":[38,51,58],"performance":[39],"WSPT":[42],"heuristic.":[43],"give":[45],"tighter":[47],"approximation":[48],"error,":[52],"and":[53],"show":[55],"that":[56],"bound":[59],"equal":[61],"to":[62],"2":[63],"under":[64],"certain":[65],"conditions.":[66],"results":[68],"obtained":[69],"complete":[70],"previous":[72],"analysis":[73],"Lee,":[75],"C-Y.,":[76],"Machine":[77],"an":[80],"availability":[81],"constraint.":[82],"J.":[83],"Glob.":[84],"Optim.,":[85],"1996,":[86],"9,":[87],"363\u2013384.":[88]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}