447 search results - page 1 / 90 » Internet shopping optimization problem |
AMCS
2010
13 years 5 months ago
2010
EOR
2006
13 years 5 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
ICDIM
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper introduces a hybrid metaheuristic, the Variable Neighborhood Particle Swarm Optimization (VNPSO), consisting of a combination of the Variable Neighborhood Search (VNS) ...
GECCO
2000
Springer
13 years 9 months ago
2000
Springer
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...
GECCO
1999
Springer
13 years 9 months ago
1999
Springer
This paper deals with the study of population diversity in Genetic Algorithms for Job Shop Scheduling Problems. A definition of population diversity at the phenotype level and a ...