The shifting bottleneck procedure for job shop scheduling
Management Science
Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
A fast taboo search algorithm for the job shop problem
Management Science
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
GA-based discrete dynamic programming approach for scheduling inFMS environments
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Multiagent scheduling method with earliness and tardiness objectives in flexible job shops
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A hybrid immune simulated annealing algorithm for the job shop scheduling problem
Applied Soft Computing
A particle swarm optimization algorithm for flexible jobshop scheduling problem
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Non-identical parallel machine scheduling using genetic algorithm
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
Computers and Industrial Engineering
Flexible job shop scheduling using a multiobjective memetic algorithm
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling
Applied Soft Computing
A multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem
International Journal of Computer Applications in Technology
Journal of Intelligent Manufacturing
Theoretical Analysis on Powers-of-Two Applied to JSP: A Case Study of Turbine Manufacturing
International Journal of Green Computing
A memetic algorithm for the multi-objective flexible job shop scheduling problem
Proceedings of the 15th annual conference on Genetic and evolutionary computation
An improved multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem
International Journal of Computer Applications in Technology
Hi-index | 0.00 |
Flexible job shop scheduling problem (fJSP) is an extension of the classical job shop scheduling problem, which provides a closer approximation to real scheduling problems. This paper addresses the fJSP problem with three objectives: min makespan, min maximal machine workload and min total workload. We develop a new genetic algorithm hybridized with an innovative local search procedure (bottleneck shifting) for the problem. The genetic algorithm uses two representation methods to depict solution candidates of the fJSP problem. Advanced crossover and mutation operators are proposed to adapt to the special chromosome structures and the characteristics of the problem. The bottleneck shifting works over two kinds of effective neighborhood, which use interchange of operation sequences and assignment of new machines for operations on the critical path. In order to strengthen search ability, the neighborhood structure can be adjusted dynamically in the local search procedure. The performance of the proposed method is tested by numerical experiments on a large number of representative problems.