Sciweavers

31 search results - page 2 / 7
» A New Hybrid Genetic Algorithm for the Job Shop Scheduling P...
Sort
View
ANOR
2008
171views more  ANOR 2008»
13 years 4 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
GECCO
2000
Springer
170views Optimization» more  GECCO 2000»
13 years 8 months ago
A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
Manuel Vázquez, L. Darrell Whitley
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
13 years 10 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
GECCO
2004
Springer
166views Optimization» more  GECCO 2004»
13 years 10 months ago
An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
Joc Cing Tay, Djoko Wibowo
CLOUDCOM
2010
Springer
13 years 2 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Di-Wei Huang, Jimmy Lin