Sciweavers

19 search results - page 2 / 4
» A hybrid method for solving stochastic job shop scheduling p...
Sort
View
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
13 years 7 months ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...
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
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 9 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
CLOUDCOM
2010
Springer
13 years 3 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
ESWA
2008
162views more  ESWA 2008»
13 years 5 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang