A Proposed Genetic Algorithm Coding for Flow-Shop Scheduling Problems

Authors

  • Hela Boukef Ecole Nationale d’Ingénieurs de Tunis Unité de recherche LARA-Automatique BP 37, Le Belvédí¨re, 1002 Tunis, Tunisie 2Ecole Centrale de Lille, Cité scientifique Laboratoire d’Automatique, Genie Informatique et Signal BP 48, 59651 Villeneuve d’Ascq Cedex, France
  • Mohamed Benrejeb Ecole Nationale d’Ingénieurs de Tunis Unité de recherche LARA-Automatique BP 37, Le Belvédí¨re, 1002 Tunis, Tunisie
  • Pierre Borne Ecole Centrale de Lille, Cité scientifique Laboratoire d’Automatique, Genie Informatique et Signal BP 48, 59651 Villeneuve d’Ascq Cedex, France

Keywords:

genetic algorithm, operations coding, flow-shop problems, multiobjective optimization, pharmaceutical industries, agro-food industries

Abstract

A new genetic algorithm coding is proposed in this paper to solve flowshop scheduling problems. To show the efficiency of the considered approach, two examples, in pharmaceutical and agro-food industries are considered with minimization of different costs related to each problem as a scope. Multi-objective optimization is thus, used and its performances proved.

References

P. Baptiste and C. Le Pape " A constraint-Based Branch and Bound Algorithm for Preemptive Job- Shop Scheduling ". 5th IEE, International Symposium on Assembly and Task Planning, Besançon, 1996.

H. Boukef, F. Tangour et M. Benrejeb " Sur la formulation d'un problème d'ordonnancement de type flow-shop d'ateliers de production en industries pharmaceutiques ". Journées Tunisiennes d'Electrotechnique et d'Automatique, JTEA'06, Hammamet, 2006.

J.L. Bouquard, J.C. Billaut, M.A. Kubzin and V.A. Strusevich " Two-machine flow-shop scheduling problems with no-wait jobs ". Operations Research Letters, vol.33, pp. 255-262, 2004. http://dx.doi.org/10.1016/j.orl.2004.06.003

J. Breït " A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint ". Computers and Operations Research, vol.33, pp. 2143-2153, 2005. http://dx.doi.org/10.1016/j.cor.2005.01.004

Y. Collette et P. Siarry " Optimisation Multiobjectif ". Editions Eyrolles, Paris, 2002.

A. Colorni, M. Dorigo, V. Maniezzo and M. Trubian " Distributed optimization by ant colonies ". First European Conference on Artificial Life, Paris, pp. 134-142, 1991.

C. Esswein, J.C. Billau, and V.A. Strusevich " Two-machine shop scheduling: Compromise between flexibility and makespan value ". European Journal of Operational Research, vol.167, pp. 796-809, 2004. http://dx.doi.org/10.1016/j.ejor.2004.01.029

F.G. Filip, G. Neagu, and D. A. Donciulescu " Job-shop scheduling optimization in real-time production control ". Computers in Industry, vol. 4, pp. 395-403, 1983. http://dx.doi.org/10.1016/0166-3615(83)90006-4

E. Gargouri, S. Hammadi and P. Borne " A distributed scheduling for agro food manufacturing problems ". Journal of IEEE Transactions on Systems, Man and Cybernetics, vol.33, 2003.

F. Glover " Tabu search, part II ". ORSA, Journal of Computing, vol.2, pp. 24-32, 1989.

G.E. Goldberg " Algorithmes génétiques ". Editions Addison-wesley, France, 1994.

J.K. Hao, P. Galinier et M. Habib " Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes ". Revue d'Intelligence Artificielle, pp. 2-39, 1999.

J.H. Holland " Adaptation in natural and artificial systems ". PhD, Michigan Press Univ., Ann Arbor, MI, 1975.

I. Kacem, S. Hammadi and P. Borne " Flexible job-shop scheduling problems: formulation, lowerbounds, encodings, and controlled evolutionary approach ". Computational Intelligence in Control, Idea Group Publishing, 2003.

P.J. Kalczynski and J. Kamburowski " On no-wait and no-idle flow shops with makespan criterion". European Journal of Operational Research, vol.178, pp. 677-685, 2006. http://dx.doi.org/10.1016/j.ejor.2006.01.036

S. Kirkpatrick and M.P. Vecchi " Optimization by simulated annealing ". Science, vol.220, pp. 671-680, 1983. http://dx.doi.org/10.1126/science.220.4598.671

T. Loukil, J. Teghem and D. Tuyttens " Solving multi-objective production scheduling problems using metaheuristics ". European Journal of Operational Research, vol.161, pp. 42-61, 2003. http://dx.doi.org/10.1016/j.ejor.2003.08.029

E. Lutton " Etat de l'art des algorithmes génétiques ", INRIA, pp.137-140, 1994.

M.H. Mabed, M. Rahoual, E.G. Talbi and C. Dhaenens " Algorithmes génétiques multicritères pour les problèmes de flow-shop ". 3ème Conférence Francophone de MOdélisation et de SIMulation, MOSIM'01, Troyes, pp. 843-849, 2001.

K. Mesghouni, S. Hammadi and P. Borne " On modeling genetic algorithm for flexible job-shop scheduling problem ". Studies in Informatics and Control Journal, vol.7, pp. 37-47, 1998.

A. Oulamara " Makespan minimization in a no-wait flow shop problem with two batching machines". Computers and Operations Research, vol.34, pp. 1033-1050, 2005. http://dx.doi.org/10.1016/j.cor.2005.05.028

I. Saad, S. Hammadi, P. Borne and M. Benrejeb " Aggregative Approach for the Multiobjective Optimization Flexible Job-Shop Scheduling Problems ". The IEEE International Conference on Service Systems and Service Management, IEEE-ICSSSM'06, pp. 889-894, Troyes, 2006. http://dx.doi.org/10.1109/icsssm.2006.320738

M. Sakarovitch " Graphes et Programmation Linéaire ". Edition Hermann, Paris, 1984.

F. Tangour, S. Hammadi, P. Borne and M. Benrejeb " Ordonnancement dynamique dans un atelier de production agroalimentaire ". Séminaire d'Automatique-Industrie, SAI'06, Matmata, 2006.

F. Tangour and I. Saad " Multiobjective optimization scheduling problems by Pareto-optimality in agro-alimentary workshop ". International Journal of Computers, Communications & Control, IJCCC, vol. I, no. 3, pp. 71-83, 2006. http://dx.doi.org/10.15837/ijccc.2006.3.2296

J. Yuan, A. Soukhal, Y. Chen and L. Lu " A note on the complexity of flow shop scheduling with transportation constraints ". European Journal of Operational Research, vol. 178, pp. 918-925, 2006. http://dx.doi.org/10.1016/j.ejor.2005.08.034

Published

2007-09-01

Issue

Vol. 2 No. 3 (2007): International Journal of Computers Communications & Control (September)

Section

Articles

License

ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.

You are free to:

-Share: copy and redistribute the material in any medium or format;

-Adapt: remix, transform, and build upon the material.

The licensor cannot revoke these freedoms as long as you follow the license terms.

 

DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.