ABSTRACT
The paper addresses the problem of synchronizing prefabricated parts for assembly into modules. We examine production environments arising out of semiconductor manufacturing and multi layer ceramics where several prefabricated parts, so-called sets, are necessary to complete a module. Frequently, some of these components are manufactured by the same production system. In order to minimize the inventory of the entire production system and simultaneously to achieve short cycle times, we propose sophisticated sequencing rules (named set management policies) to control the production of components. Based on global status information on the inventory at each service station these policies determine the component which is to be processed next. We evaluate the performance of the set management policies proposed, by means of simulation results for several production environments which feature rework and re-entrant flow. In terms of several performance measures we show that our sequencing rules achieve better results than standard rules such as FCFS of EDD. The mean of the performance measures and also their variances are considered.
- Ahmed, S. and R. R. Tummala. 1992. Overview of packaging for the IBM Enterprise System/9000 based on the glass-ceramic copper/thin film thermal conduction module. IEEE Transactions on Components, Hybrids and Manufacturing Technology 15, 426-431.Google ScholarCross Ref
- De, P., J. B. Gosh, and C. E. Wells. 1989. A note on the minimization of mean squared deviation of completion times about a common due date. Management Science 35(6), 1143-1147. Google ScholarDigital Library
- De, P., J. B. Gosh, and C. E. Wells. 1992. On the minimization of completion time variance with a bicriteria extension. Operations Research 40(6), 1148-1155. Google ScholarDigital Library
- Gise, P. and R. Blanchard. 1986. Modern semiconductor fabrication technology. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
- Hall, N. G., W. Kubiak, and S. P. Sethi. 1991. Earliness tardiness scheduling problems iI: Deviation of completion times about a restrictive common due dates. Operations Research 39(5), 847-856. Google ScholarDigital Library
- Heyman, D. P. and M. J. Sobel. 1982. Stochastic Models in Operations Research, Volume I: Stochastic Processes and Operating Characteristics. New York: McGraw-Hill.Google Scholar
- Hogg, G. L., J. Fowler, and M. Ibrahim. 1991. Flow control in semiconductor manufacturing: A survey and projection of needs. Technical report 91110757A-GEN, SEMATECH, Austin, TX.Google Scholar
- Johri, P. K. 1992. Practical issues in scheduling and dispatching in semiconductor wafer fabrication. Journal of Manufacturing Systems 12(6), 474- 485.Google ScholarCross Ref
- Lee, C.-Y. 1992. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 40(4), 764-775. Google ScholarDigital Library
- Purm, M. 1994. Reduzierung von Gruppenbearbeitungszeiten in Produktionssytemen. Master's thesis, Institute of Computer Science, University of Wfirzburg, Wiirzburg, Germany. In German.Google Scholar
- Resende, M. G. C. 1984. Computer simulation of semiconductor wafer fabrication. Technical Report ORC 86-14, Operations Research Center, University of California at Berkeley, Berkeley, CA.Google Scholar
- Uzsoy, R., L. A. Martin-Vega, C.-Y. Lee, and P. A. Leonard. 1991. Production scheduling algorithms for a semiconductor test facility. IEEE Transactions on Semiconductor Manufacturing 4(4), 270-280.Google ScholarCross Ref
- Womack, J. P., D. T. Jones, and D. Roos. 1990. The machine that changed the world. New York, NY: Rawson Associates.Google Scholar
Index Terms
- Set management: minimizing synchronization delays of prefabricated parts before assembly
Recommendations
Multi-item lot-sizing with joint set-up costs
We consider a multi-item lot-sizing problem with joint set-up costs and constant capacities. Apart from the usual per unit production and storage costs for each item, a set-up cost is incurred for each batch of production, where a batch consists of up ...
Optimal Inventory Policy with Multiple Set-Up Costs
We consider a deterministic, single product, discrete review, finite time horizon inventory problem, called the multiple set-up cost problem. The holding cost in each period is a nondecreasing and sometimes concave function. The distinguishing feature ...
Decision-theoretic rough set
We propose a DTRS by a set of cost matrices.Optimistic and pessimistic cases are two special models of our approach.Two criterions based reducts are calculated by two different algorithms. By introducing the misclassification and delayed decision costs ...
Comments