An algorithm for solving the job-shop problem
Management Science
Job shop scheduling by simulated annealing
Operations Research
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A fast taboo search algorithm for the job shop problem
Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Management Science
Evaluating simple scheduling rules in a mixed shop environment
Computers and Industrial Engineering
Problem difficulty for tabu search in job-shop scheduling
Artificial Intelligence
A hybrid genetic algorithm for the job shop scheduling problems
Computers and Industrial Engineering
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A hybrid particle swarm optimization for job shop scheduling problem
Computers and Industrial Engineering
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Computers and Operations Research
A very fast TS/SA algorithm for the job shop scheduling problem
Computers and Operations Research
Ant colony optimization combined with taboo search for the job shop scheduling problem
Computers and Operations Research
Solving job shop scheduling problems utilizing the properties of backbone and "big valley"
Computational Optimization and Applications
A GES/TS algorithm for the job shop scheduling
Computers and Industrial Engineering
Hi-index | 0.00 |
This paper presents a special case of the general shop called stage shop problem. The stage shop is a more realistic generalization of the mixed shop problem. In the stage shop problem, each job has several stages of operations. In order to solve the stage shop problem with makespan objective function, an existing neighborhood of job shop is used. In this neighborhood, few enhanced conditions are proposed to prevent cycle generation. In addition, a new neighborhood for operations that belong to the same job is presented. These neighborhoods are applied to the stage shop problem in a tabu search framework. A genetic algorithm is used to obtain good initial solutions. An existing lower bound of the job shop is adapted to our problem and the computational results have been compared to it. Our algorithm has reached the optimal solutions for more than half of the problem instances.