The shifting bottleneck procedure for job shop scheduling
Management Science
Job shop scheduling by simulated annealing
Operations Research
A fast taboo search algorithm for the job shop problem
Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Management Science
Constraint propogation techniques for the disjunctive scheduling problem
Artificial Intelligence
Tabu Search
A Computational Study of Shifting Bottleneck Procedures forShop Scheduling Problems
Journal of Heuristics
International Journal of High Performance Computing Applications
Optimised Search Heuristic Combining Valid Inequalities and Tabu Search
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Resource allocation algorithm for light communication grid-based workflows within an SLA context
International Journal of Parallel, Emergent and Distributed Systems
Proceedings of the 40th Conference on Winter Simulation
Guided Ejection Search for the Job Shop Scheduling Problem
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Parallel Simulated Annealing for the Job Shop Scheduling Problem
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines
Journal of Artificial Intelligence Research
Solution-guided multi-point constructive search for job shop scheduling
Journal of Artificial Intelligence Research
A hybrid immune simulated annealing algorithm for the job shop scheduling problem
Applied Soft Computing
An efficient job-shop scheduling algorithm based on particle swarm optimization
Expert Systems with Applications: An International Journal
A GRASP and branch-and-bound metaheuristic for the job-shop scheduling
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A hybrid constraint programming/local search approach to the job-shop scheduling problem
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Closing the open shop: contradicting conventional wisdom
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
International Journal of Bio-Inspired Computation
Solving job shop scheduling problems utilizing the properties of backbone and "big valley"
Computational Optimization and Applications
Computers and Operations Research
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
A Tabu search algorithm to minimize lateness in scheduling problems with setup times
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Restart strategies in optimization: parallel and serial cases
Parallel Computing
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
A GA/TS algorithm for the stage shop scheduling problem
Computers and Industrial Engineering
Combining PSO and local search to solve scheduling problems
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Computers and Industrial Engineering
On single-walk parallelization of the job shop problem solving algorithms
Computers and Operations Research
Information Sciences: an International Journal
A hybrid PSO/GA algorithm for job shop scheduling problem
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Annals of Mathematics and Artificial Intelligence
A competent memetic algorithm for complex scheduling
Natural Computing: an international journal
A GES/TS algorithm for the job shop scheduling
Computers and Industrial Engineering
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling
Journal of Intelligent Manufacturing
Hybrid particle swarm optimization and convergence analysis for scheduling problems
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Robotic clusters: Multi-robot systems as computer clusters
Robotics and Autonomous Systems
A genetic algorithm for the job shop on an ASRS warehouse
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Increasing the Reliability of Production Schedules in a Pharmaceutical Packaging Department
Journal of Medical Systems
Network modeling and evolutionary optimization for scheduling in manufacturing
Journal of Intelligent Manufacturing
On Maximum Speedup Ratio of Restart Algorithm Portfolios
INFORMS Journal on Computing
Journal of Intelligent Manufacturing
An integrated search heuristic for large-scale flexible job shop scheduling problems
Computers and Operations Research
| Hi-index | 0.00 |
The job shop scheduling problem with the makespan criterion is a certain NP-hard case from OR theory having excellent practical applications. This problem, having been examined for years, is also regarded as an indicator of the quality of advanced scheduling algorithms. In this paper we provide a new approximate algorithm that is based on the big valley phenomenon, and uses some elements of so-called path relinking technique as well as new theoretical properties of neighbourhoods. The proposed algorithm owns, unprecedented up to now, accuracy, obtainable in a quick time on a PC, which has been confirmed after wide computer tests.