A GA/TS algorithm for the stage shop scheduling problem

A GA/TS algorithm for the stage shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20115297
Volume: 61
Issue: 1
Start Page Number: 161
End Page Number: 170
Publication Date: Aug 2011
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.