{"id":"https://openalex.org/W2050895635","doi":"https://doi.org/10.1051/ro:1999105","title":"Contr\u00f4le dynamique de flux dans un syst\u00e8me d'attente avec panne","display_name":"Contr\u00f4le dynamique de flux dans un syst\u00e8me d'attente avec panne","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2050895635","doi":"https://doi.org/10.1051/ro:1999105","mag":"2050895635"},"language":"fr","primary_location":{"id":"doi:10.1051/ro:1999105","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:1999105","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/RO_1999__33_1_69_0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046331572","display_name":"Abdelkrim Haqiq","orcid":"https://orcid.org/0000-0002-8857-6586"},"institutions":[{"id":"https://openalex.org/I3019441195","display_name":"Laboratoire de Math\u00e9matiques d'Orsay","ror":"https://ror.org/03ab0zs98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I3019441195"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"A. Haqiq","raw_affiliation_strings":["Facult\u00e9 des Sciences et techniques, D\u00e9partement de Math\u00e9matiques et Informatique, Route de Casablanca, BP 577, Settat, Maroc, T\u00e9l. 03 40 07 36, Fax 03 40 09 69"],"affiliations":[{"raw_affiliation_string":"Facult\u00e9 des Sciences et techniques, D\u00e9partement de Math\u00e9matiques et Informatique, Route de Casablanca, BP 577, Settat, Maroc, T\u00e9l. 03 40 07 36, Fax 03 40 09 69","institution_ids":["https://openalex.org/I3019441195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008774107","display_name":"Noufissa Mikou","orcid":null},"institutions":[{"id":"https://openalex.org/I3019441195","display_name":"Laboratoire de Math\u00e9matiques d'Orsay","ror":"https://ror.org/03ab0zs98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I3019441195"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"N. Mikou","raw_affiliation_strings":["Facult\u00e9 des sciences, D\u00e9partement de Math\u00e9matiques et Informatique, avenue Ibn Batouta, BP 1014, Rabat, Maroc, T\u00e9l.07 77 54 71 Fax 07 77 54 71"],"affiliations":[{"raw_affiliation_string":"Facult\u00e9 des sciences, D\u00e9partement de Math\u00e9matiques et Informatique, avenue Ibn Batouta, BP 1014, Rabat, Maroc, T\u00e9l.07 77 54 71 Fax 07 77 54 71","institution_ids":["https://openalex.org/I3019441195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046331572"],"corresponding_institution_ids":["https://openalex.org/I3019441195"],"apc_list":null,"apc_paid":null,"fwci":0.5629,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7048878,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"33","issue":"1","first_page":"69","last_page":"86"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9778000116348267,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9697999954223633,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6782692670822144},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6139445304870605},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5521242022514343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17523613572120667},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.125743567943573}],"concepts":[{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6782692670822144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6139445304870605},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5521242022514343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17523613572120667},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.125743567943573}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro:1999105","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:1999105","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_1999__33_1_69_0","is_oa":true,"landing_page_url":"http://www.numdam.org/item/RO_1999__33_1_69_0/","pdf_url":"https://www.numdam.org/item/RO_1999__33_1_69_0.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"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_1999__33_1_69_0","is_oa":true,"landing_page_url":"http://www.numdam.org/item/RO_1999__33_1_69_0/","pdf_url":"https://www.numdam.org/item/RO_1999__33_1_69_0.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":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2050895635.pdf","grobid_xml":"https://content.openalex.org/works/W2050895635.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880"],"abstract_inverted_index":{"We":[0],"consider":[1],"two":[2,60],"parallel":[3],"M/M/1":[4],"queues.":[5],"The":[6],"server":[7],"at":[8,42],"one":[9],"of":[10,21,58],"the":[11,19,38,43,47,59],"queues":[12],"is":[13,36],"subject":[14],"to":[15,32,52],"intermittent":[16],"breakdowns.":[17],"By":[18],"theory":[20],"dynamic":[22],"programming,":[23],"we":[24],"determine":[25],"a":[26],"threshold":[27],"optimal":[28],"policy":[29],"which":[30],"consists":[31],"transfer,":[33],"when":[34],"it":[35],"necessary,":[37],"customers":[39],"that":[40],"arrive":[41],"first":[44],"queue":[45,49,61],"towards":[46],"second":[48],"in":[50],"order":[51],"minimize":[53],"an":[54],"instantaneous":[55],"cost":[56],"depending":[57],"lengths.":[62]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}