908 search results - page 96 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
220
click to vote
GECCO
2011
Springer
14 years 9 months ago
2011
Springer
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
155
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
140
click to vote
ANOR
2008
15 years 6 months ago
2008
: In this paper, a new predictive-reactive approach to a parallel machine scheduling problem in the presence of uncertain disruptions is presented. The approach developed is based ...
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper offers practical design-guidelines for developing efficient genetic algorithms (GAs) to successfully solve realworld problems. As an important design component, a prac...
132
click to vote
COR
2006
15 years 6 months ago
2006
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...