72 search results - page 3 / 15 » A Genetic Algorithm for the Two Machine Flow Shop Problem |
CEC
2007
IEEE
14 years 4 days 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...
HM
2007
Springer
13 years 12 months ago
2007
Springer
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid meta...
IPCO
1998
13 years 7 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
ICGA
1993
13 years 7 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
GECCO
2006
Springer
13 years 9 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...