Determining Production Schedule with Resource Constraints Using Drum-Buffer-Rope (DBR) Approach

Article Preview

Abstract:

In wafer plants, product will be manufactured through same process with different setups and specifications. This special manufacturing process is described as re-entrant flows. In photo process of wafer manufacturing, products is also restricted to be processed through same machine in each reentrance to improve quality. This phenomenon will cause scheduling in photo process being complicated and is proved to be a NP-hard problem. This research develops a mathematical model for photo process to minimize the makespan. A feasible solution is achieved using DBR (drum-buffer-rope) method. The results are compared to the optimal solution that is achieved using branch and bound algorithm. Our results show that DBR based method achieves a near optimal solution in shorter time. The results also indicate that DBR method can be useful in production scheduling with resource constraints.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 488-489)

Pages:

1130-1133

Citation:

Online since:

March 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] E.M. Goldratt and J. Cox: The Goal: A Process of Ongoing Improvement (North River Press, USA, 1986).

Google Scholar

[2] I. Harjunkoski and I.E. Grossmann: Comput. Chem. Eng., Vol. 26-11, (2002), p.1533.

Google Scholar

[3] I.H. Hong, Y.C. Chou, C.Y. Kuo, and L.C. Lu: Proceeding of the Eighth International Symposium on Semiconductor Manufacturing, San Francisco, California, (1999), pp.19-22.

Google Scholar

[4] D. Kayton: Electron. M. Technol. S., Vol. 4, (1998), p.352.

Google Scholar

[5] S. Kim, K.R. Davis, and J.F. Cox: Int. J. Prod. Res., Vol. 41, No. 4, (2003), p.681.

Google Scholar

[6] C. Lozinski and C.R. Glassey: IEEE Trans. Semiconduct. M., Vol. 1-4, (1988), p.147.

Google Scholar

[7] W.L. Pearn, S.H. Chung, and M.H. Yang: J. Oper. Res. S., Vol. 53-8, (2002), p.864.

Google Scholar

[8] G. Rabadi, R.J. Moraga, and A. Al-Salem: Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times., J. Intell. M., Vol. 17-1, (2006), p.85.

DOI: 10.1007/s10845-005-5514-0

Google Scholar

[9] E. Schragenheim and B. Ronen: Prod. and Inv. Manag. J., Vol. 31-3, (1990), p.18.

Google Scholar

[10] E. Schragenheim, J. Cox, and B. Ronen: Int. J. Prod. Res., Vol. 32-8, (1994), p.1867.

Google Scholar

[11] M.X. Weng, J. Lu, and H. Ren: Int. J. Prod. Econ., Vol. 70-3, (2001), p.215.

Google Scholar

[12] H.H. Wu and M.L. Yeh: Int. J. Prod. Res., Vol. 44-5, (2006), p.883.

Google Scholar

[13] Z. Zhang and R.B. Heady: Comput. Ind. Eng., Vol. 38-2, (2000), p.297.

Google Scholar