{"id":"https://openalex.org/W2768476349","doi":"https://doi.org/10.1109/codit.2017.8102727","title":"Robust preemptive scheduling on unrelated parallel machines under uncertain processing times","display_name":"Robust preemptive scheduling on unrelated parallel machines under uncertain processing times","publication_year":2017,"publication_date":"2017-04-01","ids":{"openalex":"https://openalex.org/W2768476349","doi":"https://doi.org/10.1109/codit.2017.8102727","mag":"2768476349"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2017.8102727","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2017.8102727","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"preprint","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/A5060392484","display_name":"Widad Naji","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Widad Naji","raw_affiliation_strings":["G-SCOP, Univ. Grenoble Alpes, Grenoble, France","Universit de Lyon, Universit de Saint, Saint Etienne, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"G-SCOP, Univ. Grenoble Alpes, Grenoble, France","institution_ids":["https://openalex.org/I4210094718","https://openalex.org/I899635006"]},{"raw_affiliation_string":"Universit de Lyon, Universit de Saint, Saint Etienne, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049066217","display_name":"Van\u2010Dat Cung","orcid":"https://orcid.org/0000-0002-9635-0376"},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Van-Dat Cung","raw_affiliation_strings":["G-SCOP, Univ. Grenoble Alpes, Grenoble, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"G-SCOP, Univ. Grenoble Alpes, Grenoble, France","institution_ids":["https://openalex.org/I4210094718","https://openalex.org/I899635006"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069008839","display_name":"Marie\u2010Laure Espinouse","orcid":"https://orcid.org/0000-0003-0120-661X"},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marie-Laure Espinouse","raw_affiliation_strings":["G-SCOP, Univ. Grenoble Alpes, Grenoble, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"G-SCOP, Univ. Grenoble Alpes, Grenoble, France","institution_ids":["https://openalex.org/I4210094718","https://openalex.org/I899635006"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3076,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6776561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"0986","last_page":"0991"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9976000189781189,"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.9901000261306763,"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.8899629712104797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6477572917938232},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6458138823509216},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6272317171096802},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6117849946022034},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5782216787338257},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5378384590148926},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49933624267578125},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4297918379306793},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4124217629432678},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3188468813896179},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.248440682888031}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8899629712104797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6477572917938232},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6458138823509216},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6272317171096802},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6117849946022034},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5782216787338257},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5378384590148926},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49933624267578125},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4297918379306793},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4124217629432678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3188468813896179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.248440682888031},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/codit.2017.8102727","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2017.8102727","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01730969v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01730969","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":"IEEE 4th International Conference on Control, Decision and Information Technologies, CoDIT 2017, 2017, Barcelona, Spain. pp.6 Pages","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W398503387","https://openalex.org/W633353915","https://openalex.org/W1488422606","https://openalex.org/W1569805180","https://openalex.org/W1963888335","https://openalex.org/W1965367276","https://openalex.org/W1965437596","https://openalex.org/W1994217000","https://openalex.org/W2006049518","https://openalex.org/W2006539736","https://openalex.org/W2030577492","https://openalex.org/W2044420226","https://openalex.org/W2073701432","https://openalex.org/W2082886370","https://openalex.org/W2093229192","https://openalex.org/W2153644134","https://openalex.org/W2401714665","https://openalex.org/W4253347690","https://openalex.org/W6613677064","https://openalex.org/W6712664258"],"related_works":["https://openalex.org/W4206466499","https://openalex.org/W4213379045","https://openalex.org/W3190401582","https://openalex.org/W2162001022","https://openalex.org/W4205832532","https://openalex.org/W2074319831","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470"],"abstract_inverted_index":{"In":[0],"this":[1,102],"paper,":[2],"we":[3,71,99,125],"focus":[4],"on":[5,9],"the":[6,24,44,49,54,59,67,80,84,88,108,112,123,133],"makespan":[7,46,69,86],"minimization":[8],"restricted":[10,94],"preemptive":[11],"unrelated":[12],"parallel":[13],"machines":[14],"scheduling":[15],"under":[16,26,87,131],"uncertain":[17,31],"processing":[18,32],"times.":[19],"We":[20,51],"propose":[21,72,126],"to":[22,35,39,107],"investigate":[23],"problem":[25],"discrete":[27,91],"scenario":[28,136],"representation":[29],"of":[30,58,66,90,96,111],"times":[33],"and":[34,70],"use":[36],"min-max":[37],"objective":[38],"generate":[40],"a":[41,63,73],"schedule":[42,82,104,110],"minimizing":[43,83],"worst-case":[45,68,85,114],"over":[47],"all":[48],"scenarios.":[50],"show":[52],"that":[53,78,101],"robust":[55,81,103,129],"assignment":[56],"counterpart":[57],"deterministic":[60],"formulation":[61,130],"provides":[62],"lower":[64],"bound":[65],"Mixed":[74],"Integer":[75],"Linear":[76],"Program":[77],"computes":[79],"set":[89],"scenarios":[92],"with":[93],"number":[95],"preemptions.":[97],"Moreover,":[98],"prove":[100],"is":[105,118,135],"equivalent":[106],"optimal":[109],"artificial":[113],"scenario.":[115],"Thus,":[116],"it":[117],"too":[119],"conservative.":[120],"To":[121],"reduce":[122],"conservativeness,":[124],"an":[127],"improved":[128],"which":[132],"sequence":[134],"dependent.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}