On scheduling in a GT environment

Traditional research in scheduling has concentrated on developing optimal and optional tending heuristic algorithms for n x m job shop and flow shop problems. Relatively no work has been conducted in the area of scheduling within a GT cell. This paper examines the GT cell environment from a scheduling perspective in relation to a job and flow shop, and presents a modified approach to scheduling within a GT cell that implicitly takes advantage of common setups and part family coding structures.