Using evolutionary computation and local search to solve multi-objective flexible job shop problems

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 821-828

  Ho, Nhu Binh ^a   Tay, Joc Cing ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Flexible job shop problems; Guided local search; Multi objective evolutionary algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARETO PRINCIPLE; PROBLEM SOLVING; RANDOM PROCESSES; TABU SEARCH;

FLEXIBLE JOB SHOP PROBLEMS; GUIDED LOCAL SEARCH; MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS; PARETO-OPTIMAL SOLUTIONS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 34548057047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277121     Document Type: Conference Paper

References (20)

1. A. S. Jain and S. Meeran, "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, vol. 113, pp. 390-434, 1999.
2. M. R. Garey, D. S. Johnson, and R. Sethi, "The complexity of flow shop andjob-shop scheduling," Mathematics of Operations Research, vol. 1, pp. 117-129, 1976.
3. M. Pinedo, Scheduling theory, algorithms, and systems: Prentice Hall, second edition, chapter 2, 2002.
4. Y. Mati and X. Xie, "The complexity of two-job shop problems with multi-purpose unrelated machines," European Journal of Operational Research, vol. 152, pp. 159-169, 2004.
5. J. Carlier and E. Pinson, "An Algorithm for Solving the Job-Shop Problem," Management Science, vol. 35, pp. 164-176, Feb. 1989.
6. I. Kacem, S. Hammadi, and P. Borne, "Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems," IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Reviews, vol. 32, pp. 1-13, 2002.
7. I. Kacem, S. Hammadi, and P. Borne, "Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic," Mathematics and Computers in Simulation, vol. 60, pp. 245-276, 2002.
8. N. B. Ho, J. C. Tay, and E. M. K. Lai, "An Effective Architecture for Learning and Evolving Flexible Job-Shop Schedules," European Journal of Operational Research, vol. 179, pp. 316-333, 2007.
9. W. Xia and Z. Wu, "An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems," Computers & Industrial Engineering, vol. 48, pp. 409-425, 2005.
10. M. Mastrolilli and L. M. Gambardella, "Effective Neighborhood Functions for the Flexible Job Shop Problem," Journal of Scheduling, vol. 3, pp. 3-20, 2000.
11. H. Ishibuchi, T. Yoshida, and T. Murata, "Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling," IEEE Transactions on Evolutionary Computation, vol. 7, pp. 204-223, 2003.
12. E. K. Burke and S. J. D. Landa, "The Design of Memetic Algorithms for Scheduling and Timetabling Problems," in Recent Advances in Memetic Algorithms, Studies in Fuzziness and Soft Computing, vol. 166, H. W. Krasnogor N., Smith J., Ed.: Springer, pp. 289-312, 2004.
13. K. Deb, Multi-objective optimization using evolutionary algorithms: John Wiley & Sons, 2001.
14. P. Brucker, B. Jurisch, and A. Krämer, "Complexity of scheduling problems with multi-purpose machines," Annals of Operations Research, vol. 70, pp. 57-73, 1997.
15. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," Annals of Discrete Mathematics, vol. 5, pp. 287-236, 1979.
16. C. A. C. Coello, "Recent Trends in Evolutionary Multiobjective Optimization," in Evolutionary Multiobjective Optimization: Theoretical Advances And Applications, L. J. a. R. G. Ajith Abraham, Ed. London: Springer-Verlag, pp. 7-32, 2005.
17. J. D. Schaffer, "Multiple Objective Optimization with Vector evaluated Genetic Algorithms," Proceedings of the First International conference on Genetic Algorithms, pp. 93-100, 1985.
18. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multi-objective genetic algorithm: NSGA-II," IEEE Transaction on Evolutionary Computation, vol. 6, pp. 181-197, 2002.
19. E. Zitzler and L. Thiele, "Multi-objective evolutionary algorithms: A comparative case study and the strength pareto approach," IEEE transactions on Evolutionary Computation, vol. 4, pp. 257-271, 1999.
20. J. D. Knowles and D. W. Corne, "Approximating the nondominated front using the Paretor Archived evolution strategy," Evolutionary Computation, vol. 8, pp. 149-172, 2000.