Solving the serial batching problem in job shop manufacturing systems |
| |
Authors: | Liji Shen Udo Buscher |
| |
Institution: | Faculty of Business and Economics, Technische Universitaet Dresden, 01062 Dresden, Germany |
| |
Abstract: | This paper addresses the serial batch scheduling problem embedded in a job shop environment to minimize makespan. Sequence dependent family setup times and a job availability assumption are also taken into account. In consideration of batching decisions, we propose a tabu search algorithm which consists of various neighborhood functions, multiple tabu lists and a sophisticated diversification structure. Computational experiments show that our algorithm outperforms a well-known tabu search approach which is developed for solving the traditional job shop problem. These results also confirm the benefits of batching. |
| |
Keywords: | Tabu search Scheduling Job shop Batching |
本文献已被 ScienceDirect 等数据库收录! |