Two Algorithms for Store-Room Operations

A growing amount of attention is being devoted to the manufacturing process throughout the world. Most problems that come out of factory environment are analytically intractable, complicated problems. In this paper we briefly describe our approach to two such problems. First problem concerns with sequencing selects in the store-room so that various operations are uniformly loaded. Among others Toyota plant in Japan is using an algorithm to 'solve' this problem. Second problem is the tape sequencing and slot assignment problem. Machine set-ups in the tape sequencing area may conceivably limit the efficacy of the store-room in a Just-In-Time environment.