A GA/TS algorithm for the stage shop scheduling problem

✍ Scribed by Mohammad Mahdi Nasiri; Farhad Kianfar

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 570 KB
• Volume: 61
• Category: Article
• ISSN: 0360-8352
• DOI: 10.1016/j.cie.2011.03.006

✦ Synopsis

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.