Abstract
In this paper, we are interested in the multi-objective evaluation of the schedule performance in the flexible job shops. The Flexible Job Shop Scheduling Problem (FJSP) is known in the literature as one of the hardest combinatorial optimization problems and presents many objectives to be optimized. In this way, we aim to determine a set of lower bounds for certain criteria which will be able to characterize the feasible solutions of such a problem. The studied criteria are the following: the makespan, the workload of the critical machine, and the total workload of all the machines. Our study relates to the determination of a practical method using fuzzy logic in order to evaluate the representative performance of the production system. The performance of such fuzzy evaluation is shown by applying an evolutionary algorithm and by comparing the values of the different solutions with the corresponding lower-bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Brandimarte, Routing and scheduling in Flexible job shops by tabu search, Annals of Operations Research 41 (1993) 157–183.
I. Kacem, S. Hammadi, P. Borne, Approach by Localization and Multi-objective Evolutionary Optimization for Flexible Job-Shop Scheduling Problems. IEEE Transactions on Systems, Man, and Cybernetics, PART C, Vol 32, N°1, ppl-13, 2002.
P. Brucker, J. Neyer, Tabu search for the multi-mode job-shop problem, OR-Spektrum 20, 1998, p 21–28.
K. Mesghouni, Application des algorithmes évolutionnistes dans les problèmes d’optimisation en ordonnancement de production, Thèse, USTL, 5 janvier, 1999, France.
I. Kacem, Ordonnancement multicritère des job-shops flexibles: formulation, bornes inférieures et approche évolutionniste coopérative. Ph.D Thesis. Ecole Centrale de Lille. January 6th, 2003, France.
S. Dauzère-Pérès, J. Paulli, An integrated approach for modelling and solving the general multiprocessor job-shop scheduling problem using tabu search, Annals of Oper. Res., 70 (1997), pp. 281–306.
Mastrolilli M., Gambardella L.M., (1998). Effective Neighborhood Functions for the Flexible Job Shop Problem, Journal of Scheduling, Volume 3, Issue 1, 2000. Pages: 3–20.
S. Dauzère-Pérès, W. Roux, J.B. Lasserre, Multi-Resource Shop Scheduling Problem with Resource Flexibility, EJOR, n°107, pp. 289–305, 1998.
J. Carlier, The one-machine sequencing problem, European Journal of Operational Research, 11 (1) (1982), pp 42–47.
B. Jurisch, Scheduling Jobs in Shops with Multi-purpose Machines, Ph.D thesis, Fachbereich Mathematik/Informatik, Universitat Osnabruck, 1992.
J. Carlier, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, European Journal of Operational Research, 29 (1987) 298–306, North-Holland.
I. Kacem, S. Hammadi, P. Borne, Bornes Inférieures pour les Problèmes d’Ordonnancement des Job-shop Flexibles, CIFA’02, Juillet, 2002, Nantes, France.
J.C. Billaut, J. Carlier, E. Néron, Ordonnancement d’ateliers à ressources multiples. Ordonnancement de la production, Edition Hermès, 2002, France.
J. Carlier, An algorithm for solving the job shop problem. Management science, Vol. 35, 1989, p164–176.
I. Kacem, S. Hammadi, P. Borne, Approche évolutionniste modulaire contrôlée pour le problème du type job-shop flexible, Proceedings of JDA’2001, Journées Doctorales d’Automatique, 25–27 septembre 2001, Toulouse, France (in french) (available at the web address: http://www.laas.fr/JDA2001/Actes/kacem.pdf).
I. Kacem, S. Hammadi, P. Borne, Pareto-optimality Approach for Flexible Job-shop Scheduling Problems: Hybridization of Evolutionary Algorithms and Fuzzy Logic. Journal of Mathematics and Computers in Simulation, Elsevier, 2002.
D. Boucon, Ordonnancement d’Atélier: aide au choix de règles de priorité, Thèse ENSAE, Toulouse, 1991, France.
G. Bel, J-B. Cavaillé, Approche simulatoire, Chapitre 6 de: Ordonnancement de la production, Sous la direction de P. Lopez et de F. Roubellat, Hermès, 2001. France.
M-C. Portmann, Study on Crossover Operators Keeping good schemata for some scheduling problems, Genetic and Evolutionary Computation Conference, Las Vegas, 8–12 juillet 2000, USA.
L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New-York, 1990, USA.
Y. W. Leung, Y. Wang, Multiobjective Programming Using Uniform Design and Genetic Algorithm, IEEE/SMC Transactions, Part C, Vol 30, August 2000, pp 293–303.
I. Hurink. B. Jurisch. M. Thole, Tabu search for the job-shop scheduling problem with multi-purpose machines, OR-Spektrum 15, pp 205–215.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kacem, I., Borne, P. (2004). Evaluating Schedule Performance in Flexible Job-Shops. In: Ruan, D., Zeng, X. (eds) Intelligent Sensory Evaluation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07950-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-07950-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05791-5
Online ISBN: 978-3-662-07950-8
eBook Packages: Springer Book Archive