Optimal routing in several deterministic queues with two service times
Identifieur interne :
000823 ( PascalFrancis/Corpus );
précédent :
000822;
suivant :
000824
Optimal routing in several deterministic queues with two service times
Auteurs : Bruno Gaujal ;
Emmanuel HyonSource :
-
Journal européen des systèmes automatisés [ 1269-6935 ] ; 2002.
RBID : Pascal:03-0117047
Descripteurs français
English descriptors
Abstract
In this article we present some extensions of optimal routing problems for parallel deterministic queues. Our goal is to minimize the sojourn time of the customers in the system. The cases studied are two parallel queues and N parallel queues.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 1269-6935 |
|---|
| A03 | | 1 | | @0 J. eur. syst. autom. |
|---|
| A05 | | | | @2 36 |
|---|
| A06 | | | | @2 7 |
|---|
| A08 | 01 | 1 | ENG | @1 Optimal routing in several deterministic queues with two service times |
|---|
| A09 | 01 | 1 | ENG | @1 Modelling of Reactive Systems |
|---|
| A11 | 01 | 1 | | @1 GAUJAL (Bruno) |
|---|
| A11 | 02 | 1 | | @1 HYON (Emmanuel) |
|---|
| A12 | 01 | 1 | | @1 JUANOLE (Guy) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 VALETTE (Robert) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 VERNADAT (François) @9 ed. |
|---|
| A14 | 01 | | | @1 INRIA/LIP, ENS Lyon, 46 Allée d'Italie @2 69364 Lyon @3 FRA @Z 1 aut. |
|---|
| A14 | 02 | | | @1 LORIA INRIA, UMR 7503, 615 route du jardin botanique, BP 101 @2 54602 Villers-les-Nancy @3 FRA @Z 2 aut. |
|---|
| A15 | 01 | | | @1 LAAS-CNRS @2 Toulouse @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A15 | 02 | | | @1 Université Paul Sabatier @2 Toulouse @3 FRA @Z 1 aut. |
|---|
| A15 | 03 | | | @1 INSA @2 Toulouse @3 FRA @Z 3 aut. |
|---|
| A20 | | | | @1 945-957 |
|---|
| A21 | | | | @1 2002 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A24 | 01 | | | @0 fre |
|---|
| A43 | 01 | | | @1 INIST @2 26104 |
|---|
| A44 | | | | @0 A300 |
|---|
| A45 | | | | @0 11 ref. |
|---|
| A47 | 01 | 1 | | @0 03-0117047 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Journal européen des systèmes automatisés |
|---|
| A66 | 01 | | | @0 FRA |
|---|
| C01 | 01 | | ENG | @0 In this article we present some extensions of optimal routing problems for parallel deterministic queues. Our goal is to minimize the sojourn time of the customers in the system. The cases studied are two parallel queues and N parallel queues. |
|---|
| C02 | 01 | X | | @0 001D02D10 |
|---|
| C03 | 01 | X | FRE | @0 Politique optimale @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Optimal policy @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Política óptima @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Routage @5 11 |
|---|
| C03 | 02 | X | ENG | @0 Routing @5 11 |
|---|
| C03 | 02 | X | SPA | @0 Enrutamiento @5 11 |
|---|
| C03 | 03 | X | FRE | @0 Temps service @5 12 |
|---|
| C03 | 03 | X | ENG | @0 Service time @5 12 |
|---|
| C03 | 03 | X | SPA | @0 Tiempo servicio @5 12 |
|---|
| C03 | 04 | X | FRE | @0 File attente @5 13 |
|---|
| C03 | 04 | X | ENG | @0 Queue @5 13 |
|---|
| C03 | 04 | X | SPA | @0 Fila espera @5 13 |
|---|
| C03 | 05 | X | FRE | @0 Approche déterministe @5 21 |
|---|
| C03 | 05 | X | ENG | @0 Deterministic approach @5 21 |
|---|
| C03 | 05 | X | SPA | @0 Enfoque determinista @5 21 |
|---|
| C03 | 06 | X | FRE | @0 mots mécaniques @4 INC @5 82 |
|---|
| N21 | | | | @1 069 |
|---|
| N82 | | | | @1 PSI |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 MSR'2001: Reactive Systems Modeling. Conference @2 3 @3 Toulouse FRA @4 2001-10 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 03-0117047 CRAN |
|---|
| ET : | Optimal routing in several deterministic queues with two service times |
|---|
| AU : | GAUJAL (Bruno); HYON (Emmanuel); JUANOLE (Guy); VALETTE (Robert); VERNADAT (François) |
|---|
| AF : | INRIA/LIP, ENS Lyon, 46 Allée d'Italie/69364 Lyon/France (1 aut.); LORIA INRIA, UMR 7503, 615 route du jardin botanique, BP 101/54602 Villers-les-Nancy/France (2 aut.); LAAS-CNRS/Toulouse/France (1 aut., 2 aut., 3 aut.); Université Paul Sabatier/Toulouse/France (1 aut.); INSA/Toulouse/France (3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Journal européen des systèmes automatisés; ISSN 1269-6935; France; Da. 2002; Vol. 36; No. 7; Pp. 945-957; Abs. français; Bibl. 11 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | In this article we present some extensions of optimal routing problems for parallel deterministic queues. Our goal is to minimize the sojourn time of the customers in the system. The cases studied are two parallel queues and N parallel queues. |
|---|
| CC : | 001D02D10 |
|---|
| FD : | Politique optimale; Routage; Temps service; File attente; Approche déterministe; mots mécaniques |
|---|
| ED : | Optimal policy; Routing; Service time; Queue; Deterministic approach |
|---|
| SD : | Política óptima; Enrutamiento; Tiempo servicio; Fila espera; Enfoque determinista |
|---|
| LO : | INIST-26104 |
|---|
| ID : | 03-0117047 |
|---|
Links to Exploration step
Pascal:03-0117047
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Optimal routing in several deterministic queues with two service times</title>
<author><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA/LIP, ENS Lyon, 46 Allée d'Italie</s1>
<s2>69364 Lyon</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Hyon, Emmanuel" sort="Hyon, Emmanuel" uniqKey="Hyon E" first="Emmanuel" last="Hyon">Emmanuel Hyon</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA INRIA, UMR 7503, 615 route du jardin botanique, BP 101</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0117047</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0117047 CRAN</idno>
<idno type="RBID">Pascal:03-0117047</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000823</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Optimal routing in several deterministic queues with two service times</title>
<author><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA/LIP, ENS Lyon, 46 Allée d'Italie</s1>
<s2>69364 Lyon</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Hyon, Emmanuel" sort="Hyon, Emmanuel" uniqKey="Hyon E" first="Emmanuel" last="Hyon">Emmanuel Hyon</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA INRIA, UMR 7503, 615 route du jardin botanique, BP 101</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Journal européen des systèmes automatisés</title>
<title level="j" type="abbreviated">J. eur. syst. autom.</title>
<idno type="ISSN">1269-6935</idno>
<imprint><date when="2002">2002</date>
</imprint><seriesStmt><title level="j" type="main">Journal européen des systèmes automatisés</title>
<title level="j" type="abbreviated">J. eur. syst. autom.</title>
<idno type="ISSN">1269-6935</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Deterministic approach</term>
<term>Optimal policy</term>
<term>Queue</term>
<term>Routing</term>
<term>Service time</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Politique optimale</term>
<term>Routage</term>
<term>Temps service</term>
<term>File attente</term>
<term>Approche déterministe</term>
<term>mots mécaniques</term>
</keywords><front><div type="abstract" xml:lang="en">In this article we present some extensions of optimal routing problems for parallel deterministic queues. Our goal is to minimize the sojourn time of the customers in the system. The cases studied are two parallel queues and N parallel queues.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>1269-6935</s0>
</fA01><fA03 i2="1"><s0>J. eur. syst. autom.</s0>
</fA03><fA08 i1="01" i2="1" l="ENG"><s1>Optimal routing in several deterministic queues with two service times</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Modelling of Reactive Systems</s1>
</fA09><fA11 i1="01" i2="1"><s1>GAUJAL (Bruno)</s1>
</fA11><fA11 i1="02" i2="1"><s1>HYON (Emmanuel)</s1>
</fA11><fA12 i1="01" i2="1"><s1>JUANOLE (Guy)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>VALETTE (Robert)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>VERNADAT (François)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>INRIA/LIP, ENS Lyon, 46 Allée d'Italie</s1>
<s2>69364 Lyon</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14><fA14 i1="02"><s1>LORIA INRIA, UMR 7503, 615 route du jardin botanique, BP 101</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14><fA15 i1="01"><s1>LAAS-CNRS</s1>
<s2>Toulouse</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA15><fA15 i1="02"><s1>Université Paul Sabatier</s1>
<s2>Toulouse</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA15><fA15 i1="03"><s1>INSA</s1>
<s2>Toulouse</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA15><fA20><s1>945-957</s1>
</fA20><fA21><s1>2002</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA24 i1="01"><s0>fre</s0>
</fA24><fA43 i1="01"><s1>INIST</s1>
<s2>26104</s2>
</fA43><fA44><s0>A300</s0>
</fA44><fA45><s0>11 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>03-0117047</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Journal européen des systèmes automatisés</s0>
</fA64><fA66 i1="01"><s0>FRA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>In this article we present some extensions of optimal routing problems for parallel deterministic queues. Our goal is to minimize the sojourn time of the customers in the system. The cases studied are two parallel queues and N parallel queues.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02D10</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Politique optimale</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Optimal policy</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Política óptima</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Routage</s0>
<s5>11</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Routing</s0>
<s5>11</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Enrutamiento</s0>
<s5>11</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Temps service</s0>
<s5>12</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Service time</s0>
<s5>12</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Tiempo servicio</s0>
<s5>12</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>File attente</s0>
<s5>13</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Queue</s0>
<s5>13</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Fila espera</s0>
<s5>13</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Approche déterministe</s0>
<s5>21</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Deterministic approach</s0>
<s5>21</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Enfoque determinista</s0>
<s5>21</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>mots mécaniques</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03><fN21><s1>069</s1>
</fN21><fN82><s1>PSI</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>MSR'2001: Reactive Systems Modeling. Conference</s1>
<s2>3</s2>
<s3>Toulouse FRA</s3>
<s4>2001-10</s4>
</fA30><server><NO>PASCAL 03-0117047 CRAN</NO>
<ET>Optimal routing in several deterministic queues with two service times</ET>
<AU>GAUJAL (Bruno); HYON (Emmanuel); JUANOLE (Guy); VALETTE (Robert); VERNADAT (François)</AU>
<AF>INRIA/LIP, ENS Lyon, 46 Allée d'Italie/69364 Lyon/France (1 aut.); LORIA INRIA, UMR 7503, 615 route du jardin botanique, BP 101/54602 Villers-les-Nancy/France (2 aut.); LAAS-CNRS/Toulouse/France (1 aut., 2 aut., 3 aut.); Université Paul Sabatier/Toulouse/France (1 aut.); INSA/Toulouse/France (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Journal européen des systèmes automatisés; ISSN 1269-6935; France; Da. 2002; Vol. 36; No. 7; Pp. 945-957; Abs. français; Bibl. 11 ref.</SO>
<LA>Anglais</LA>
<EA>In this article we present some extensions of optimal routing problems for parallel deterministic queues. Our goal is to minimize the sojourn time of the customers in the system. The cases studied are two parallel queues and N parallel queues.</EA>
<CC>001D02D10</CC>
<FD>Politique optimale; Routage; Temps service; File attente; Approche déterministe; mots mécaniques</FD>
<ED>Optimal policy; Routing; Service time; Queue; Deterministic approach</ED>
<SD>Política óptima; Enrutamiento; Tiempo servicio; Fila espera; Enfoque determinista</SD>
<LO>INIST-26104</LO>
<ID>03-0117047</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000823 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000823 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:03-0117047
|texte= Optimal routing in several deterministic queues with two service times
}}
| This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 |  |
