31 search results - page 3 / 7 » The hybrid flow shop scheduling problem |
COR
2011
2011
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
13 years 24 days ago
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
ICDIM
2007
IEEE
14 years 15 hour 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
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
1999
Springer
13 years 10 months ago
1999
Springer
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
ICDCS
1992
IEEE
13 years 9 months ago
1992
IEEE
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...