New heuristic based on a hypergraph representation for the tool switching problem

International Journal of Production Economics

Volumn 64, Issue 1, 2000, Pages 165-176

  Djellab, Housni ^a   Djellab, Khaled ^a   Gourgand, Michel ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; FLEXIBLE MANUFACTURING SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING; PROCESS ENGINEERING; SCHEDULING;

HYPERGRAPHS; TOOL SWITCHING;

PRODUCTION CONTROL;

EID: 0033907566     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(99)00055-9     Document Type: Article

References (14)

1. Tang C.S., Denardo E.V. Models arising from flexible manufacturing machine, minimization of the number of tool switches Operations Research. 36(5):1988;767-784.
2. Crama Y., Kolen A.W.J., Oerlemans A.G., Spieksma F.C.R. Minimizing the number of tool switches on a flexible machine. The International Journal of Flexible Manufacturing Systems. 6:1994;33-54.
3. Y. Crama, J. van de Klundert, The approximability of tool management problems, Maastricht Research School of Economics of Technology and ORganizations METEOR, 1996.
4. C. Privault, G. Finke, Tool management on NC-machines, Proceding of the International Conference on Industrial Engineering and Production Management, IEPM'93, Mons, Belgium, 1993, 667-676.
5. C. Privault, Modèles mathématiques pour la gestion off-line et on-line des changements d'outils sur une machine flexible, Thesis de l'Université Joseph Fourier-Grenoble I, 1994.
6. Bard J. A heuristic for minimizing the number of tool switches on a flexible machine. IIE Transaction. 20(4):1988;382-391.
7. Hertz A., Widmer M. La méthode TABOU appliquée aux problémes d'ordonnancement. Automatique Production Informatique Industrielle RAIRO-APII. 29(4-5):1995;353-378.
8. Follonier J.-P. Minimization of the number of tool switches on a flexible manufacturing machine, Belgian Journal of Operations Research. Statistics and Computer Science. 34(1):1994;55-72.
9. H. Djellab, K. Djellab, M. Gourgand, Hypergraph representation for the tool switching problem, Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM'97, Lyon, France, 1997, pp. 342-352.
10. Berge C. Hypergraphes. Combinatoire des ensembles finis:1991;Gouthier-Villars, Paris.
11. Kou L.T. Polynomial complete consecutive information retrieval problems. SIAM Journal on Computing. 6(1):1977;67-75.
12. Booth K., Lueker G. Testing for the consecutive one's property, interval graphs and planar graphs using PQ-Trees. Journal of Computers and System Science. 13:1976;335-379.
13. Baptiste P., Cho C.H., Favel J., Zouhri M. Une caractéristique analytique des ordonnancements admissibles sous contraintes hétèrogèes en flow shop. Automatique Production Informatique Industrielle RAIRO-APII. 25:1991;87-102.
14. H. Djellab, Optimisation combinatoire dans les systèmes de production: Hypergraphes et méthodes d'amélioration itératives, Ph.D. Thesis de l'Université Blaise Pascal, Clermont-Ferrand II, 1997.