{"id":"https://openalex.org/W1979934361","doi":"https://doi.org/10.1109/imcsit.2008.4747349","title":"On a class of periodic scheduling problems: Models, lower bounds and heuristics","display_name":"On a class of periodic scheduling problems: Models, lower bounds and heuristics","publication_year":2008,"publication_date":"2008-10-01","ids":{"openalex":"https://openalex.org/W1979934361","doi":"https://doi.org/10.1109/imcsit.2008.4747349","mag":"1979934361"},"language":"en","primary_location":{"id":"doi:10.1109/imcsit.2008.4747349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/imcsit.2008.4747349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Multiconference on Computer Science and Information Technology","raw_type":"proceedings-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/A5016889937","display_name":"Philippe Michelon","orcid":"https://orcid.org/0000-0001-6648-5651"},"institutions":[{"id":"https://openalex.org/I198415970","display_name":"Universit\u00e9 d'Avignon et des Pays de Vaucluse","ror":"https://ror.org/00mfpxb84","country_code":"FR","type":"education","lineage":["https://openalex.org/I198415970"]},{"id":"https://openalex.org/I4210119991","display_name":"Laboratoire Informatique d'Avignon","ror":"https://ror.org/02n399288","country_code":"FR","type":"facility","lineage":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Philippe Michelon","raw_affiliation_strings":["Laboratoire dInformatique dAvignon, Universit\u00e9 d''Avignon, Avignon, France","Lab. d'Inf. d'Avignon, Univ. d'Avignon, Avignon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire dInformatique dAvignon, Universit\u00e9 d''Avignon, Avignon, France","institution_ids":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]},{"raw_affiliation_string":"Lab. d'Inf. d'Avignon, Univ. d'Avignon, Avignon","institution_ids":["https://openalex.org/I198415970"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110613067","display_name":"Dominique Quadri","orcid":null},"institutions":[{"id":"https://openalex.org/I198415970","display_name":"Universit\u00e9 d'Avignon et des Pays de Vaucluse","ror":"https://ror.org/00mfpxb84","country_code":"FR","type":"education","lineage":["https://openalex.org/I198415970"]},{"id":"https://openalex.org/I4210119991","display_name":"Laboratoire Informatique d'Avignon","ror":"https://ror.org/02n399288","country_code":"FR","type":"facility","lineage":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dominique Quadri","raw_affiliation_strings":["Laboratoire dInformatique dAvignon, Universit\u00e9 d''Avignon, Avignon, France","Lab. d'Inf. d'Avignon, Univ. d'Avignon, Avignon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire dInformatique dAvignon, Universit\u00e9 d''Avignon, Avignon, France","institution_ids":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]},{"raw_affiliation_string":"Lab. d'Inf. d'Avignon, Univ. d'Avignon, Avignon","institution_ids":["https://openalex.org/I198415970"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091776727","display_name":"Marcos Negreiros","orcid":null},"institutions":[{"id":"https://openalex.org/I102939073","display_name":"Universidade Estadual do Cear\u00e1","ror":"https://ror.org/00sec1m50","country_code":"BR","type":"education","lineage":["https://openalex.org/I102939073"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcos Negreiros","raw_affiliation_strings":["Departamento de Estat\u00edstica e Computa\u00e7\u00e3o, Universidade Estadual do Cea\u00e1, Fortaleza, Brazil","Dept. de Estatistica e Comput., Univ. Estadual do Ceara, Fortaleza"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Estat\u00edstica e Computa\u00e7\u00e3o, Universidade Estadual do Cea\u00e1, Fortaleza, Brazil","institution_ids":["https://openalex.org/I102939073"]},{"raw_affiliation_string":"Dept. de Estatistica e Comput., Univ. Estadual do Ceara, Fortaleza","institution_ids":["https://openalex.org/I102939073"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3453,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.66865604,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"899","last_page":"906"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9793000221252441,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9728000164031982,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/heuristics","display_name":"Heuristics","score":0.7285955548286438},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6154510974884033},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6118900775909424},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5580404996871948},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5325998663902283},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.48195454478263855},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4713422954082489},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46477487683296204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4618145227432251},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.44146889448165894},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4241657853126526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.396128386259079},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11742272973060608},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.06068301200866699}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7285955548286438},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6154510974884033},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6118900775909424},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5580404996871948},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5325998663902283},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.48195454478263855},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4713422954082489},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46477487683296204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4618145227432251},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.44146889448165894},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4241657853126526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.396128386259079},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11742272973060608},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.06068301200866699},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/imcsit.2008.4747349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/imcsit.2008.4747349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Multiconference on Computer Science and Information Technology","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01318570v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01318570","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 Multiconference on Computer Science and Information Technology, Oct 2008, Wisla, Poland. ⟨10.1109/IMCSIT.2008.4747349⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/3","display_name":"Good health and well-being","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W32283066","https://openalex.org/W1486833693","https://openalex.org/W1608622666","https://openalex.org/W1964586194","https://openalex.org/W1980696029","https://openalex.org/W1981238054","https://openalex.org/W2012645320","https://openalex.org/W2023598419","https://openalex.org/W2029507626","https://openalex.org/W2048152400","https://openalex.org/W2056830486","https://openalex.org/W2061616782","https://openalex.org/W2075598223","https://openalex.org/W2081403536","https://openalex.org/W2088679389","https://openalex.org/W2095130077","https://openalex.org/W2096318933","https://openalex.org/W2096732213","https://openalex.org/W2102027414","https://openalex.org/W2104338317","https://openalex.org/W2109488193","https://openalex.org/W2119809695","https://openalex.org/W2151576803","https://openalex.org/W2287716296","https://openalex.org/W2399166038","https://openalex.org/W2962089679","https://openalex.org/W3105368489","https://openalex.org/W4242577232","https://openalex.org/W6636276828","https://openalex.org/W6669565306","https://openalex.org/W6712788540"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W3119129187","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768"],"abstract_inverted_index":{"We":[0,51,69],"study":[1],"in":[2],"this":[3],"paper":[4],"a":[5,72],"generalization":[6],"of":[7,40,46,61,81,91,117],"the":[8,29,38,41,47,62,79,82,107,115],"basic":[9],"strictly":[10],"periodic":[11],"scheduling":[12],"problem":[13,34,63],"where":[14],"two":[15,57],"positive":[16],"integer":[17,58],"constants,":[18],"associated":[19],"to":[20,27,86,99],"each":[21],"task,":[22],"are":[23,66,97,104,128],"introduced":[24],"such":[25],"that":[26,122],"replace":[28],"usual":[30],"strict":[31],"period.":[32],"This":[33],"is":[35,44,76,120],"motivated":[36],"by":[37,114],"combat":[39],"dengue":[42],"which":[43,65,75,103],"one":[45],"major":[48],"tropical":[49],"disease.":[50],"discuss":[52],"general":[53],"properties":[54],"and":[55,90],"propose":[56],"mathematical":[59],"models":[60],"considered":[64],"compared":[67,105],"theoretically.":[68],"also":[70],"suggest":[71],"lower":[73],"bound":[74],"derived":[77],"from":[78],"structure":[80],"problem.":[83],"It":[84,119],"appears":[85],"be":[87,112],"quickly":[88],"obtained":[89,113],"good":[92],"quality.":[93],"Three":[94],"greedy":[95,126],"algorithms":[96,127],"proposed":[98],"provide":[100],"feasible":[101],"solutions":[102],"with":[106],"optimum":[108],"(when":[109],"it":[110],"can":[111],"use":[116],"ILOG-Cplex10.0).":[118],"shown":[121],"for":[123],"special":[124],"instances":[125],"optimal.":[129]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}