841 search results - page 4 / 169 » Job Scheduling in Rings |
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
ANOR
2008
13 years 7 months ago
2008
: The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is ...
FUN
2010
Springer
13 years 10 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
JSSPP
1998
Springer
13 years 11 months ago
1998
Springer
