The shifting bottleneck procedure for job shop scheduling
Management Science
Neuro-fuzzy and soft computing: a computational approach to learning and machine intelligence
Neuro-fuzzy and soft computing: a computational approach to learning and machine intelligence
A systematic procedure for setting parameters in simulated annealing algorithms
Computers and Operations Research
Constraint Propagation in Flexible Manufacturing
Constraint Propagation in Flexible Manufacturing
Constraint-Based Scheduling
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
A hybrid particle swarm optimization for job shop scheduling problem
Computers and Industrial Engineering
A very fast TS/SA algorithm for the job shop scheduling problem
Computers and Operations Research
Computers and Industrial Engineering
Ant colony optimization combined with taboo search for the job shop scheduling problem
Computers and Operations Research
Application areas of AIS: The past, the present and the future
Applied Soft Computing
Computers and Operations Research
Computers and Operations Research
Research of Production Scheduling Algorithm Based on Bottleneck Analysis
CCCM '08 Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 03
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
A novel genetic algorithm based on immunity
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Computers and Operations Research
The periodicity and robustness in a single-track train scheduling problem
Applied Soft Computing
A new hybrid genetic algorithm for job shop scheduling problem
Computers and Operations Research
Information Sciences: an International Journal
Journal of Intelligent Manufacturing
Solving the team orienteering problem using effective multi-start simulated annealing
Applied Soft Computing
Information Sciences: an International Journal
Self-Optimization module for Scheduling using Case-based Reasoning
Applied Soft Computing
Two-machine robotic cell scheduling problem with sequence-dependent setup times
Computers and Operations Research
Hi-index | 0.00 |
A hybrid simulated annealing algorithm based on a novel immune mechanism is proposed for the job shop scheduling problem with the objective of minimizing total weighted tardiness. The proposed immune procedure is built on the following fundamental idea: the bottleneck jobs existing in each scheduling instance generally constitute the key factors in the attempt to improve the quality of final schedules, and thus, the sequencing of these jobs needs more intensive optimization. To quantitatively describe the bottleneck job distribution, we design a fuzzy inference system for evaluating the bottleneck level (i.e. the criticality) of each job. By combining the immune procedure with a simulated annealing algorithm, we design a hybrid optimization algorithm which is subsequently tested on a number of job shop instances. Computational results for different-sized instances show that the proposed hybrid algorithm performs effectively and converges fast to satisfactory solutions.