175 search results - page 2 / 35 » Approximation Algorithms for Flexible Job Shop Problems |
ESWA
2008
13 years 6 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
AOR
2007
13 years 6 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
EPS
1997
Springer
13 years 10 months ago
1997
Springer
This paper describes a GA for job shop scheduling problems. Using the Giffler and Thompson algorithm, we created two new operators, THX crossover and mutation, which better trans...
ICTCS
2001
Springer
13 years 10 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
ECAI
1994
Springer
13 years 10 months ago
1994
Springer
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...