175 search results - page 5 / 35 » Approximation Algorithms for Flexible Job Shop Problems |
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...
COR
2011
2011
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
13 years 2 months 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...
SCHEDULING
2010
13 years 2 months ago
2010
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
We solve the Flexible Job-Shop Problem (FJSP) by using dispatching rules discovered through Genetic Programming (GP). While Simple Priority Rules (SPR) have been widely applied in ...
JSW
2006
13 years 7 months ago
2006
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...