200 search results - page 3 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
ICALP
2000
Springer
13 years 9 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
MP
2002
13 years 5 months ago
2002
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
AOR
2007
13 years 5 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....
AIPS
2008
13 years 8 months ago
2008
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
IJCNN
2006
IEEE
13 years 11 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...