Abstract
Remanufacturing is a growing branch of the traditional manufacturing industry. In this study, a discrete harmony search (DHS) algorithm is proposed for the dynamic flexible job shop scheduling problem (FJSSP) in remanufacturing. Firstly, the dynamic flexible job shop scheduling in remanufacturing engineering is described. Secondly, the harmony search algorithm is discretized for the dynamic flexible job shop scheduling problem. Thirdly, a new method for improving a new harmony is proposed based on the characteristics of dynamic FJSSP and solution representation. Finally, simulation experiments are carried out to test the proposed discrete harmony search algorithm. The results show the effectiveness of the proposed DHS algorithm in solving the disassembly scheduling problem in remanufacturing engineering.
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
Lund, R.I.: Remanufacturing. Technology Review 87(2), 18–23 (1984)
Krupp, J.A.: Structuring bills of material for automotive remanufacturing. Production and Inventory Management Journal 34(4), 46–52 (1993)
Krupp, J.A.: Core obsolescence forecasting in remanufacturing. Production and Inventory Management Journal 33(2), 12–17 (1992)
Guide Jr., V.D.R., Srivastava, R., Spencer, M.S.: A evaluation of capacity planning techniques in a remanufacturing environment. International Journal of Production Research 35(1), 67–82 (1997)
Guide Jr., V.D.R., Srivastava, R., Kraus, M.E.: Product structure complexity and scheduling of operations in recoverable manufacturing. International Journal of Production Research 35(11), 3179–3200 (1997)
DePuy, G.W., Usher, J.S., Walker, R.L., Taylor, G.D.: Production planning for remanufactured products. Production Planning & Control 18(7), 573–583 (2007)
Teunter, R.H., Bayindir, Z.P., Van Den Heuvel, W.: Dynamic lot sizing with product returns and remanufacturing. International Journal of Production Research 44(20), 4377–4400 (2006)
Grubbström, R.W., Tang, O.: Optimal production opportunities in a remanufacturing system. International Journal of Production Research 44(18), 3953–3966 (2006)
Denizel, M., Fergusonand, M., Souza, G.C.: Multiperiod remanufacturing planning with uncertain quality of inputs. IEEE Transactions on Engineering Management 57(3), 394–404 (2010)
Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)
Lee, K.S., Geem, Z.W., Lee, S.H., Bae, K.W.: The harmony search heuristic algorithm for discrete structural optimization. Eng. Optimiz. 37(7), 663–684 (2005)
Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Appl. Math. and Comput. 188(2), 1567–1579 (2007)
Geem, Z.W., Lee, K.S., Park, Y.: Application of harmony search to vehicle routing. Am. J. Appl. Sci. 2(12), 1552–1557 (2005)
Geem, Z.W.: Optimal cost design of water distribution networks using harmony search. Eng. Optimiz. 38(3), 259–280 (2006)
Geem, Z.W.: Optimal Scheduling of Multiple Dam System Using Harmony Search Algorithm. In: Sandoval, F., Prieto, A.G., Cabestany, J., Graña, M. (eds.) IWANN 2007. LNCS, vol. 4507, pp. 316–323. Springer, Heidelberg (2007)
Geem, Z.W.: Harmony Search Algorithm for Solving Sudoku. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part I. LNCS (LNAI), vol. 4692, pp. 371–378. Springer, Heidelberg (2007)
Zarei, O., Fesanghary, M., Farshi, B., Saffar, R.J., Rafar, M.R.: Optimization of multi-pass face-milling via harmony search algorithm. J. Mater. Process. Tech. 209(5), 2386–2392 (2009)
Coelho, L.S., Bernert, D.L.A.: An improved harmony search algorithm for synchronization of discrete-time chaotic system. Chaos Solitons Fract 41(5), 2526–2532 (2009)
Wang, L., Pan, Q.K., Tasgetiren, M.F.: Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert Syst. Appl. 37(12), 7929–7936 (2010)
Pan, Q.K., Suganthan, P.N., Liang, J.J., Tasgetiren, M.F.: A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Syst. Appl. 38(4), 3252–3259 (2011)
Gao, K.Z., Pan, Q.K., Li, J.Q.: Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion. Int. J. Adv. Manuf. Technol. 56, 683–692 (2011)
Gao, K.Z., Pan, Q.K., Li, J.Q., et al.: A hybrid harmony search algorithm for the no-wait flow shop scheduling problems. Asia-Pacific J. of Operational Research 29(2), 1250012 (23 pages) (2012)
Yadav, P., Kumar, R., Panda, S.K., Chang, C.S.: An improved harmony search algorithm for optimal scheduling of the diesel generators in oil rig platforms. Energ. Convers. Manage. 52(2), 893–902 (2011)
Geem, Z.W.: Novel Derivative of Harmony Search Algorithm for Discrete Design Variables. Applied Mathematics and Computation 199(1), 223–230 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, K.Z., Suganthan, P.N., Chua, T.J. (2012). Discrete Harmony Search Algorithm for Dynamic FJSSP in Remanufacturing Engineering. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Nanda, P.K. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2012. Lecture Notes in Computer Science, vol 7677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35380-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-35380-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35379-6
Online ISBN: 978-3-642-35380-2
eBook Packages: Computer ScienceComputer Science (R0)