{"id":"https://openalex.org/W2128580449","doi":"https://doi.org/10.1051/ro:20070012","title":"Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity","display_name":"Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2128580449","doi":"https://doi.org/10.1051/ro:20070012","mag":"2128580449"},"language":"en","primary_location":{"id":"doi:10.1051/ro:20070012","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:20070012","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro:20070012.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064116931","display_name":"Mohamed Ali Aloulou","orcid":null},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mohamed Ali Aloulou","raw_affiliation_strings":["LAMSADE \u2013 Universit\u00e9 Paris Dauphine, Place du Mar\u00e9chal de Lattre de Tassigny, 75775 Paris Cedex 16, France; aloulou@lamsade.dauphine.fr"],"affiliations":[{"raw_affiliation_string":"LAMSADE \u2013 Universit\u00e9 Paris Dauphine, Place du Mar\u00e9chal de Lattre de Tassigny, 75775 Paris Cedex 16, France; aloulou@lamsade.dauphine.fr","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049674028","display_name":"Mikhail Y. Kovalyov","orcid":"https://orcid.org/0000-0003-0832-0829"},"institutions":[{"id":"https://openalex.org/I151823869","display_name":"National Academy of Sciences of Belarus","ror":"https://ror.org/02j8pe645","country_code":"BY","type":"government","lineage":["https://openalex.org/I151823869"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Mikhail Y. Kovalyov","raw_affiliation_strings":["Faculty of Economics, Belarusian State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus; koval@newman.bas-net.by"],"affiliations":[{"raw_affiliation_string":"Faculty of Economics, Belarusian State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus; koval@newman.bas-net.by","institution_ids":["https://openalex.org/I151823869"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111959498","display_name":"Marie\u2010Claude Portmann","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I70768539","display_name":"\u00c9cole Nationale Sup\u00e9rieure des Mines de Paris","ror":"https://ror.org/04y8cs423","country_code":"FR","type":"education","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I70768539"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marie-Claude Portmann","raw_affiliation_strings":["MACSI team of INRIA-Lorraine and LORIA-INPL, \u00c9cole des Mines de Nancy, Parc de Saurupt, 54042 Nancy Cedex, France; portmann@loria.fr"],"affiliations":[{"raw_affiliation_string":"MACSI team of INRIA-Lorraine and LORIA-INPL, \u00c9cole des Mines de Nancy, Parc de Saurupt, 54042 Nancy Cedex, France; portmann@loria.fr","institution_ids":["https://openalex.org/I70768539","https://openalex.org/I90183372","https://openalex.org/I4210121838"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064116931"],"corresponding_institution_ids":["https://openalex.org/I56435720"],"apc_list":null,"apc_paid":null,"fwci":3.3909,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.92138199,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"41","issue":"1","first_page":"1","last_page":"18"},"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.9945999979972839,"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.9819999933242798,"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/maximization","display_name":"Maximization","score":0.7289005517959595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7131677269935608},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6983073353767395},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6695849299430847},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5471982359886169},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47487375140190125},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4309135675430298},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4272363781929016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15814262628555298}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7289005517959595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7131677269935608},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6983073353767395},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6695849299430847},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5471982359886169},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47487375140190125},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4309135675430298},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4272363781929016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15814262628555298},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro:20070012","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:20070012","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2007__41_1_1_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:20070012/","pdf_url":"https://www.numdam.org/item/10.1051/ro:20070012.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:HAL:inria-00118734v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00118734","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":"RAIRO - Operations Research, 2007, 41 (1), pp.1--18. ⟨10.1051/ro:20070012⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2007__41_1_1_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:20070012/","pdf_url":"https://www.numdam.org/item/10.1051/ro:20070012.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320952","display_name":"International Science and Technology Center","ror":"https://ror.org/03fn1w943"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2128580449.pdf"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W568095434","https://openalex.org/W1488422606","https://openalex.org/W1514643469","https://openalex.org/W1588284186","https://openalex.org/W1965367276","https://openalex.org/W1983340643","https://openalex.org/W1986237126","https://openalex.org/W1988328380","https://openalex.org/W2000764840","https://openalex.org/W2022839718","https://openalex.org/W2042312329","https://openalex.org/W2138898223","https://openalex.org/W2147507583","https://openalex.org/W2341350247","https://openalex.org/W4254424307","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1581479499","https://openalex.org/W2024806294","https://openalex.org/W2095303169","https://openalex.org/W997954202","https://openalex.org/W4236295709","https://openalex.org/W2022632482","https://openalex.org/W2530969325","https://openalex.org/W2520902986","https://openalex.org/W2793037814","https://openalex.org/W2795923574"],"abstract_inverted_index":{"We":[0,172],"study":[1],"a":[2,23,28,33,39,84],"deterministic":[3],"problem":[4],"of":[5,11,25,36,41,49,67,83,119,122,166,205],"evaluating":[6],"the":[7,15,42,47,65,88,92,110,116,120,125,130,137,144,148,154,161,167,187,203],"worst":[8,93,131],"case":[9,90,94,98,132],"performance":[10,82,99,103,133],"flexible":[12,20,57,85,126,138],"solutions":[13],"in":[14,147],"single":[16],"machine":[17,79],"scheduling.":[18],"A":[19,56],"solution":[21,58,86,139],"is":[22,100],"set":[24,121,204],"schedules":[26,48,123],"following":[27,143],"given":[29,145,201],"structure":[30,146],"determined":[31],"by":[32,160],"partial":[34],"order":[35],"jobs":[37,188],"and":[38,51,91,153,163,175,196],"type":[40,53],"schedules.":[43],"In":[44,128,184],"this":[45],"paper,":[46],"active":[50],"non-delay":[52],"are":[54,157],"considered.":[55],"can":[59,105],"be":[60,106,190,200],"used":[61],"on-line":[62,111,149],"to":[63,114,189],"absorb":[64],"impact":[66],"data":[68],"disturbances":[69],"related":[70],"to,":[71],"for":[72,179],"example,":[73],"job":[74],"arrival,":[75],"tool":[76],"availability":[77],"or":[78],"breakdowns.":[80],"The":[81,96,151],"includes":[87],"best":[89,97,117],"performances.":[95],"an":[101],"ideal":[102],"that":[104],"achieved":[107],"only":[108],"if":[109],"conditions":[112],"allow":[113],"implement":[115],"schedule":[118],"characterizing":[124],"solution.":[127],"contrast,":[129],"indicates":[134],"how":[135],"poorly":[136],"may":[140,199],"perform":[141],"when":[142],"circumstances.":[150],"best-case":[152],"worst-case":[155],"performances":[156],"usually":[158],"evaluated":[159],"minimum":[162],"maximum":[164],"values":[165],"considered":[168],"objective":[169],"function,":[170],"respectively.":[171],"present":[173],"algorithmic":[174],"computational":[176],"complexity":[177],"results":[178],"some":[180],"maximization":[181],"scheduling":[182],"problems.":[183],"these":[185],"problems,":[186],"scheduled":[191],"have":[192],"different":[193],"release":[194],"dates":[195],"precedence":[197],"constraints":[198],"on":[202],"jobs.":[206]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}