Abstract
Capital-intensive facilities called electronic fabrications (“FABs” in short) are operated twenty-four hours a day to meet the massive orders on time. The main objectives of scheduling the complex manufacturing process are to meet the on time delivery and to maximize machine utilization. A discrete event simulation approach has brought good results to generate an efficient and practical schedule. However, the approach tends to make short-term decision, which loads any job rather than stays idle. When the setup time is long and the number of crews is limited, being idle could be a better decision than changing jobs. This paper proposes a method to compensate for the limitations of simulation-based schedulers. We propose a Gantt chart simulation approach that formulates WIP level with an incoming profile and a consuming profile with the number of loaded machines. With two profiles, we can determine when to add or release a machine for each job. The proposed method has been applied to a real factory and showed promising results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gupta, A.K., Sivakumar, A.I.: Job Shop Scheduling Techniques in Semiconductor Manufacturing. International Journal of Advanced Manufacturing Technology 27, 1163–1169 (2006)
Monch, L., Fowler, J.W., Dauzere-Peres, S., Mason, S.J., Rose, O.: A Survey of Problems, Solution Techniques, and Future Challenges in Scheduling Semiconductor Manufacturing Operations. Journal of Scheduling 14, 583–599 (2011)
Carlier, J.: Scheduling Jobs with Release Dates and Tails on Identical Machines to Minimize the Makespan. European Journal of Operational Research 29, 298–306 (1987)
Balin, S.: Non-identical Parallel Machine Scheduling using Genetic Algorithm. Expert Systems with Applications 38, 6814–6821 (2011)
Cakar, T., Koker, R., Sari, Y.: Parallel Robot Scheduling to Minimize Mean Tardiness with Unequal Release Date and Precedence Constraints using a Hybrid Intelligent System. International Journal of Advanced Robotic Systems 9 (2012), http://cdn.intechopen.com/pdfs/41481.pdf
Acosta, J.H.T., Gonzalez, V.A.P., Bello, C.A.L.: A Genetic Algorithm for Simultaneous Scheduling Problem in Flexible Flow Shop Environments with Unrelated Parallel Machines, Setup Time and Multiple Criteria. In: Archenti, A., Maffei, A. (eds.) International Conference on Advanced Manufacturing Engineering and Technologies, pp. 203–210 (2013)
Vinod, V., Sridharan, R.: Simulation-based Metamodels for Scheduling a Dynamic Job Shop with Sequence-dependent Setup Times. International Journal of Production Research 47(6), 1425–1447 (2009)
Park, B.C., Park, E.S., Kim, B.H., Choi, B.K., Lee, J.H.: Simulation Based Planning and Scheduling Systems for TFT-LCD FAB. In: Mason, S.J., Hill, R.R., Mönch, L., Rose, O., Jefferson, T., Fowler, J.W. (eds.) 2008 Winter Simulation Conference, pp. 2271–2276. IEEE Press, New York (2008)
Ko, K., Yoo, S.K., Kim, B.H., Park, B.C., Park, E.S.: Simulation Based FAB Scheduler: SeePlan®. In: Johansson, B., Jain, S., Montoya-Torres, J., Hugan, J., Yücesan, E. (eds.) 2010 Winter Simulation Conference, pp. 40–48. IEEE Press, New York (2010)
Ramasesh, R.: Dynamic Job Shop Scheduling: a Survey of Simulation Research. Omega 18, 43–57 (1990)
Choi, B.K., You, N.K.: Dispatching Rules for Dynamic Scheduling of One-of-a-kind Production. International Journal of Computer Integrated Manufacturing 19(4), 383–392 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, T., Choi, B.K., Ko, K., Kang, D. (2014). Gantt Chart Simulation for FAB Scheduling. In: Tanaka, S., Hasegawa, K., Xu, R., Sakamoto, N., Turner, S.J. (eds) AsiaSim 2014. AsiaSim 2014. Communications in Computer and Information Science, vol 474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45289-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-662-45289-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45288-2
Online ISBN: 978-3-662-45289-9
eBook Packages: Computer ScienceComputer Science (R0)