A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem

This publication has 11 references indexed in Scilit:

• An effective architecture for learning and evolving flexible job-shop schedules
  European Journal of Operational Research, 2007
• A heuristic to schedule flexible job-shop in a glass factory
  European Journal of Operational Research, 2005
• Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic
  Mathematics and Computers in Simulation, 2002
• A fast and elitist multiobjective genetic algorithm: NSGA-II
  IEEE Transactions on Evolutionary Computation, 2002
• Effective neighbourhood functions for the flexible job shop problem
  Journal of Scheduling, 2000
• Benchmarks for shop scheduling problems
  European Journal of Operational Research, 1998
• A hierarchical approach for the FMS scheduling problem
  European Journal of Operational Research, 1995
• Tabu search for the job-shop scheduling problem with multi-purpose machines
  OR Spectrum, 1994
• Tabu Search—Part I
  INFORMS Journal on Computing, 1989
• The Shifting Bottleneck Procedure for Job Shop Scheduling
  Management Science, 1988