30 search results - page 4 / 6 » A Comparison of Genetic Algorithms for the Dynamic Job Shop ... |
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
CAV
2001
Springer
14 years 3 hour ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...