A Flow Shop Rank Approach to GT Scheduling.(Dept.M)

Previous gronp technology heuristics have not focused on the problem formulation: they have focused on family and dispatching rules which lead to different results depending on the type of die problem. The objective of this paper is to present a static exhaustive heuristic lo solve such problem for unlimited job shop manufacturing cell. It is mainly based on decomposing the cell-queue into subfamilies and con structing a graph showing the setup relationships between the machine arrangement aud the current partition of subfamilies. The solution is similar to that made in the flow shops in a simple applicable fashion. The heuristic is a trial to formulate the problem in an equivaleut flow shop to simplify the cell ussessmenr.