A heuristic algorithm for group scheduling |
| |
Authors: | R Radharamanan |
| |
Affiliation: | Department of Mechanical and Industrial Engineering University of Utah, Salt Lake City, Utah 84112, USA |
| |
Abstract: | Group technology is a rapidly developing productivity improvement tool that can have a significant impact on the development of totally integrated manufacturing facilities and flexible manufacturing systems. Production scheduling associated with group technology is called “Group Scheduling”. There are many heuristic algorithms developed for general job shop applications based on unrealistic hypothesis, complicated computations etc., which are not addressed to group scheduling. In this paper, from the existing algorithms for group scheduling, a heuristic algorithm has been developed and programmed for computer/microcomputer applications. The developed algorithm has been used to determine the optimal group and the optimal job sequence for a batch type production process with functional layout. The developed algorithm is far simpler and easier to compute, compared to the other similar heuristic algorithms and certainly in comparison to other optimization methods such as branch and bound method. |
| |
Keywords: | Group technology group scheduling flexible manufacturing group layout functional layout batch type production optimization methods machine cell part family heuristic algorithm |
本文献已被 ScienceDirect 等数据库收录! |
|