77 search results - page 2 / 16 » Using Genetic Algorithms to Solve the Tactical Fixed Interva... |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
CLOUDCOM
2010
Springer
13 years 2 months ago
2010
Springer
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...
DAC
1995
ACM
13 years 8 months ago
1995
ACM
Abstract A central problem in embedded system co-synthesis is the generation of software for lowlevel I O. Scheduling still remains a manual task because existing coarse-grained re...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
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...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
This paper discusses the issues that arise in the design and implementation of an industrialstrength evolutionary-based system for the optimization of the monthly work schedules f...