The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Les problèmes d'ordonnancement de type flow-shop hybride :
état de l'art
A. Vignier; J.-C. Billaut; C. Proust
RAIRO - Operations Research
(2010)
- Volume: 33, Issue: 2, page 117-183
- ISSN: 0399-0559
A special class of scheduling problems is studied in this paper,
named Hybrid Flowshop, n jobs have to be performed
in a shop and each of them has the same routing (so this is
a flowshop). A job consists in k different operations.
A set of machines are able to perform each operation and this
set is called a stage. So when a job consists in two operations,
there are two stages in the shop. After introducing the scheduling
generalities, we define our preocupations and we propose a notation
in order to identify precisely and rapidly a problem. Then a state
of the art is proposed and presented in two parts. The first one is
dedicated to the 2-stage hybrid flowshops and the second to the
general case of the k-stage. Then a summary puts to the fore
that many problems remain unsolved.
Vignier, A., Billaut, J.-C., and Proust, C.. "Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art ." RAIRO - Operations Research 33.2 (2010): 117-183. <http://eudml.org/doc/116592>.
@article{Vignier2010,
abstract = {
A special class of scheduling problems is studied in this paper,
named Hybrid Flowshop, n jobs have to be performed
in a shop and each of them has the same routing (so this is
a flowshop). A job consists in k different operations.
A set of machines are able to perform each operation and this
set is called a stage. So when a job consists in two operations,
there are two stages in the shop. After introducing the scheduling
generalities, we define our preocupations and we propose a notation
in order to identify precisely and rapidly a problem. Then a state
of the art is proposed and presented in two parts. The first one is
dedicated to the 2-stage hybrid flowshops and the second to the
general case of the k-stage. Then a summary puts to the fore
that many problems remain unsolved.
},
author = {Vignier, A., Billaut, J.-C., Proust, C.},
journal = {RAIRO - Operations Research},
keywords = {Scheduling; Hybrid Flowshop; state of the art. ; scheduling; hybrid flowshop; state of the art},
language = {eng},
month = {3},
number = {2},
pages = {117-183},
publisher = {EDP Sciences},
title = {Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art },
url = {http://eudml.org/doc/116592},
volume = {33},
year = {2010},
}
TY - JOUR
AU - Vignier, A.
AU - Billaut, J.-C.
AU - Proust, C.
TI - Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 33
IS - 2
SP - 117
EP - 183
AB -
A special class of scheduling problems is studied in this paper,
named Hybrid Flowshop, n jobs have to be performed
in a shop and each of them has the same routing (so this is
a flowshop). A job consists in k different operations.
A set of machines are able to perform each operation and this
set is called a stage. So when a job consists in two operations,
there are two stages in the shop. After introducing the scheduling
generalities, we define our preocupations and we propose a notation
in order to identify precisely and rapidly a problem. Then a state
of the art is proposed and presented in two parts. The first one is
dedicated to the 2-stage hybrid flowshops and the second to the
general case of the k-stage. Then a summary puts to the fore
that many problems remain unsolved.
LA - eng
KW - Scheduling; Hybrid Flowshop; state of the art. ; scheduling; hybrid flowshop; state of the art
UR - http://eudml.org/doc/116592
ER -
Citations in EuDML Documents
top
You must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.