Sciweavers

ESWA
2010
175views more  ESWA 2010»
13 years 9 months ago
A multi-objective PSO for job-shop scheduling problems
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
D. Y. Sha, Hsing-Hung Lin
ANOR
2008
171views more  ANOR 2008»
13 years 11 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
CAV
2001
Springer
107views Hardware» more  CAV 2001»
14 years 3 months ago
Job-Shop Scheduling Using Timed Automata
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
Yasmina Abdeddaïm, Oded Maler
IJCNN
2006
IEEE
14 years 4 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— 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...
Shengxiang Yang
CEC
2007
IEEE
14 years 5 months ago
Modified genetic algorithm for job-shop scheduling: A gap utilization technique
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...