-
Articles citing this article
-
Same authors
- PubMed - Recommend this article
- Download citation
- Alert me if this article is cited
- Alert me if this article is corrected
|
|||||||||||||||
DOI: 10.1051/ro:1999120
RAIRO Rech. Opér. (vol. 33, n
4, 1999, pp. 439-445)
Optimal scheduling of the 3-machine assembly-type flow shop
Mohamed Haouari1 and Thouraya Daouas2
1Ecole Polytechnique de Tunisie, BP. 743, 2078 La Marsa, Tunisia.
2Institut des Hautes Etudes Commerciales, 2016 CarthagePresidence, Tunisia.
Abstract:
Résumé:
Nous nous interessons au probleme d'ordonnancement de 3 machines dans un atelier d'assemblage de type flowshop. Ce probleme est connu comme etant NP-complet au sens fort. Nous proposons un algorithme exact de separation et evaluation progressives, base sur une enumeration recursive des entrees et des sorties potentielles des machines. Des problemes de grande taille ont ete resolus d'une maniere optimale. À notre connaissance, il s'agit de la premiere fois, ou ce probleme est resolu exactement.
Keywords: Scheduling, flow shop, branch and bound, assembly-type production.
Copyright EDP Sciences
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook