Assignment and scheduling in flexible job-shops by hierarchical optimization

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 37, Issue 4, 2007, Pages 652-661

  Zribi, Nozha ^a   Kacem, Imed ^b   El Kamel, Abdelkader ^a   Borne, Pierre ^a  

^a ECOLE CENTRALE DE LILLE   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Assignment problem; Branch and bound; Genetic algorithms (GAs); Job shop scheduling problem; Local search; Lower bounds

Indexed keywords

BRANCH-AND-BOUND ALGORITHM; HIERARCHICAL OPTIMIZATION; HYBRID GENETIC ALGORITHM; LOCAL SEARCH;

GENETIC ALGORITHMS; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; OPTIMIZATION;

SCHEDULING;

EID: 34447306016     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2007.897494     Document Type: Article

References (26)

1. W. Banzhaf, P. Nordin, R. E. Keller, and F.D. Francone, Genetic Programming: An Introduction on the Automatic Evolution of Computer Programs and its Application. San Francisco, CA: Morgan Kaufmann, 1999.
2. G. Bel and J.-B. Cavaillé, "Approche simulatoire," in Ordonnancement de la Production, Sous la Direction de, P. Lopez and F. Roubellat, Eds. Paris, France: Hermès, 2000.
3. P. Brandimarte, "Routing and scheduling in flexible job shops by tabu search," Ann. Oper. Res., vol. 41, pp. 157-183, 1993.
4. E. K. Burke and A. J. Smith, "Hybrid evolutionary techniques for the maintenance scheduling problem," IEEE Trans. Power Syst., vol. 15, no. 1, pp. 122-128, Feb. 2000.
5. J. Carlier, "An algorithm for solving the job shop problem," Manage. Sci., vol. 35, pp. 164-176, 1989.
6. J. Carlier and P. Chretienne, Problèmes d'Ordonnancement: Modélisation/Complexité/Algorithmes. Paris, France: Editions Masson, 1988.
7. C. Caux, H. Pierreval, and M. C. Portmann, "Les algorithmes génétiques et leur application aux problèmes d'ordonnancement," Kevie APII (Automatique Productique et Informatique Industrielle), vol. 29, no. 4-5, pp. 409-443, 1995.
8. F. Chetouane, "Ordonnancement d'atelierà tr̂aches généralisées, perturbations, réactiviét," Polytech. Nat. Inst. Grenoble, Grenoble, France, DEA Rep., 1995.
9. D. Dasgupta and Z. Michalewicz, Evolutionary Algorithms in Engineering Applications. Berlin, Germnay: Springer-Verlag, 1997.
10. S. Dauzère-Pérès and J. Paulli, "An integrated approach formodelling and solving the general multiprocessor job-shop scheduling problem using tabu search," Ann. Oper. Res., vol. 70, pp. 281-306, 1997.
11. L. Davis, Handbook of Genetic Algorithms. New-York: Van Nostrand Reinhold, 1990.
12. L. Djerid and M.-C. Portmann, "Genetic algorithm operators restricted to precedent constraints set: Genetic algorithm designs with or without branch and bound approach for solving scheduling problems with disjunctive constraints," in Proc. Int IEEE Syst., Man., Cybern. Conf., Peking, China, Oct. 14-17, 1996, vol. 4, pp. 2922-2927.
13. D. B. Fogel, "An introduction to simulated evolutionary optimization," IEEE Trans. Neural Netw., vol. 5, no. 1, pp. 3-14, Jan. 1994.
14. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to Theory of NP-Completeness. New York: Freeman, 1979.
15. F. Glover and M. Laguna, Tabu Search. Boston, MA: Kluwer, 1997.
16. L. Han, G. Kendall, and P. Cowling, "An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem," in Proc. 4th Asia-Pacific Conf. Simulated Evol. Learn. SEAL 2002, Lecture Notes in Artificial Intelligence, to be published.
17. J. Hurink, B. Jurisch, and M. Thole, "Tabu search for the job-shop scheduling problem with multi-purpose machines," OR Spektr., vol. 15, pp. 205-215, 1994.
18. I. Kacem, S. Hammadi, and P. Borne, "Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems," IEEE Syst., Man, Cybern., C: Appl. Rev., vol. 32, no. 1, pp. 1-13, Feb. 2002.
19. 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, Lille, France, Jan. 2003.
20. E. L. Lawler, J. K. Lenstra, A. H. G. R. Kan, and D. B. Shomoys, "Sequencing and scheduling algorithms and complexity," in Logistics of Production and Inventory, S. C. Graves, A. H. G. R. Kan, and P. H. Zipkin, Eds. Amsterdam, The Netherlands: North Holland, 1993.
21. K. M. Lee, T. Yamakawa, and K.-M. Lee, "A genetic algorithm for general machine scheduling problems6," in Proc. Int. Conf. Conv. Knowl.-Based Electron. Syst. (KES 1998), Adelaide, Australia, vol. 2, pp. 60-66.
22. M. Mastrolilli and L.M. Gambardella, "Effective neighborhood functions for the flexible job shop problem," J. Scheduling, vol. 3, no. 1, pp. 3-20, 2000.
23. K. Mezghouni, "Application des algorithmes volutionnistes dans les problmes d'optimisatin en ordonnancement de production," Ph.D. dissertation, Montpellier, France, USTL 2451, 1999.
24. E. Nowicki and C. Smutnicki, "A fast taboo search algorithm for the job-shop problem," Manage. Sci., vol. 42, no. 6, pp. 797-813, 1996.
25. R. Sarker, H. A. Abbas, and C. Newton, "Solving multi-objective optimization problems using evolutionary algorithm," presented at the Int. CIMCA Conf., Las Vegas, NV, Jul. 2001.
26. K. C. Tan, E. F. Khor, T. H. Lee, and R. Sathikannan, "An evolutionary algorithmwith advanced goal and priority specification for multi-objective optimization," J. Artif. Intell. Res., vol. 18, pp. 183-215, 2003.