Modular design of a hybrid genetic algorithm for a flexible job–shop scheduling problem

This publication has 15 references indexed in Scilit:

• An optimal dynamic threat evaluation and weapon scheduling technique
  Knowledge-Based Systems, 2010
• An artificial immune algorithm for the flexible job-shop scheduling problem
  Future Generation Computer Systems, 2010
• Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan
  Knowledge-Based Systems, 2010
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
  Computers & Operations Research, 2008
• A multiagent evolutionary algorithm for constraint satisfaction problems
  IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2006
• A Mixed Closure-CSP Method to Solve Scheduling Problems
  Lecture Notes in Computer Science, 2001
• Effective neighbourhood functions for the flexible job shop problem
  Journal of Scheduling, 2000
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
  Annals of Operations Research, 1997
• Routing and scheduling in a flexible job shop by tabu search
  Annals of Operations Research, 1993
• Job-shop scheduling with multi-purpose machines
  Computing, 1990