Development of dynamic layout model for poundo yam flour processing plant

References

• Afolami, K. A. (2014). Development and performance evaluation of washing, peeling and parboiling machines for a poundo yam flour process plant (Unpublished ME thesis). Department of Mechanical Engineering, Federal University of Technology, Akure.
   Google Scholar
• Ajamu, T. A. (2014). Development and performance evaluation of drying, milling and sieving machines for a poundo yam flour process plant. (Unpublished ME thesis). Department of Mechanical Engineering, Federal University of Technology, Akure.
   Google Scholar
• Alan, R. M. J., & Shang, J. (2004). Hybrid ant systems for the dynamic facility layout problem. Computers & Operations Research, 33, 790–803.
   Web of Science ®Google Scholar
• Amine, D., Henri, P., & Sonia, H. (2007). Facility layout problems: A survey. Annual Reviews in Control, 31, 255–267.
   Web of Science ®Google Scholar
• Ayodeji, S. P., Khubulani, M., Oduetse, M., & Mohammed, O. O. (2015). A control system for a poundo yam flour processing plant. African Journal of Science, Technology, Innovation and Development, 7, 192–200.10.1080/20421338.2015.1040285
   Web of Science ®Google Scholar
• Ayodeji, S. P., Olabanji, O. M., & Adeyeri, M. K. (2012). Design of a process plant for the production of poundo yam. International Journal of Engineering (IJE), 6, 10–24.
   Google Scholar
• Balakrishnan, J., & Cheng, C. H. (2000). Genetic search and the dynamic layout problem. Computers and Operations Research, 27, 587–593.10.1016/S0305-0548(99)00052-0
   Web of Science ®Google Scholar
• Balakrishnan, J., Cheng, C. H., Conway, D. G., & Lau, C. M. (2003). A hybrid genetic algorithm for the dynamic plant layout problem. International Journal of Production Economics, 86, 107–120.10.1016/S0925-5273(03)00027-6
   Web of Science ®Google Scholar
• Baykasoğlu, A., & Gindy, N. N. Z. (2001). A simulated annealing algorithm for dynamic layout problem. Computers and Operations Research, 28, 1403–1426.10.1016/S0305-0548(00)00049-6
   Web of Science ®Google Scholar
• Bos, J. (1993). Zoning in forest management a quadratic assignment problem solved by simulated annealing. Journal of Environmental Management, 37, 127–145.
   Web of Science ®Google Scholar
• Heragu, S. (1992). Recent models and techniques for solving the layout problem. European Journal of Operational Research, 57, 136–144.10.1016/0377-2217(92)90038-B
   Web of Science ®Google Scholar
• Kaku, B., & Mazzola, J. B. (1997). A Tabu-search heuristic for the Plant Layout Problem. INFORMS Journal on Computing, 9, 374–384.10.1287/ijoc.9.4.374
   Google Scholar
• Koopmans, T. C., & Beckmann, M. (1957). Assignment problems and the location of economic activities. Econometrica, 25, 53–76.10.2307/1907742
   Web of Science ®Google Scholar
• Kusiak, A., & Heragu, S. S. (1987). The facility layout problem. European Journal of Operational Research, 29, 229–251.10.1016/0377-2217(87)90238-4
   Web of Science ®Google Scholar
• McKendall Jr., A. R., & Shang, J. (2006a). Hybrid ant systems for the dynamic facility layout problem. Computers and Operations Research, 33, 790–803.10.1016/j.cor.2004.08.008
   Web of Science ®Google Scholar
• McKendall Jr., A. R., & Shang, J. (2006b). Simulated annealing heuristics for the dynamic facility layout problem. Computers and Operations Research, 33, 2431–2444.10.1016/j.cor.2005.02.021
   Web of Science ®Google Scholar
• Ogunsua, A. (2016). Design of dynamic facility layout and virtual monitoring system for poundo yam flour processing plant (Unpublished ME thesis). Department of Mechanical Engineering, Federal University of Technology, Akure.
   Google Scholar
• Subodh, B. P., & Kuber, S. S. (2014). Productivity improvement in plant by using systematic layout planning (Slp) - A case study of medium scale industry. International Journal of Research in Engineering and Technology, 3(4).
   Google Scholar
• Wu, T. H., Chung, S. H., & Chang, C. C. (2008). Hybrid simulated annealing algorithm with mutation operator to the cell formation problem with alternative process routings. Expert Systems with Applications, 36, 3652–3661.
   Web of Science ®Google Scholar