1,047
Views
56
CrossRef citations to date
0
Altmetric
Articles

An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time

, , &
Pages 5896-5911 | Received 20 Oct 2014, Accepted 04 Feb 2015, Published online: 11 Mar 2015

References

  • Brandimarte, P. 1993. “Routing and Scheduling in a Flexible Job Shop by Tabu Search, Ann.” Operations Research 41 (3): 157–183.
  • Brucker, P., and R. Schlie. 1990. “Scheduling-probleme in Jop-shops Mit Mehrzweckmaschinen.” Computing 45 (4): 369–375.10.1007/BF02238804
  • Demir, Y., and S. K. İşleyen. 2014. “An Effective Genetic Algorithm for Flexible Job Shop Scheduling with Overlapping in Operations.” International Journal of Production Research 52 (13): 3905–3921.10.1080/00207543.2014.889328
  • Gao, J., L. Y. Sun, and M. Gen. 2008. “A Hybrid Genetic and Variable Neighborhood Descent Algorithm for Flexible Job Shop Scheduling Problems.” Computers & Operations Research 35 (9): 2892–2907.10.1016/j.cor.2007.01.001
  • Gao, K. Z., Q. K. Pan, and J. Q. Li. 2011. “Discrete Harmony Search Algorithm for the No-wait Flow Shop Scheduling Problem with Total Flow Time Criterion.” The International Journal of Advanced Manufacturing Technology 56 (5–8): 683–692.10.1007/s00170-011-3197-6
  • Gao, K. Z., Q. K. Pan, J. Q. Li, and J. J. Liang. 2012. “A Hybrid Harmony Search Algorithm for the No-wait Flow Shop Scheduling Problems.” Asia-Pacific Journal of Operational Research 29 (2): 1–23. 1250012.
  • Gao, K. Z., P. N. Suganthan, Q. K. Pan, T. J. Chua, T. X. Cai, and C. S. Chong. 2014a. “Discrete Harmony Search Algorithm for Flexible Job Shop Scheduling Problem with Multiple Objectives.” Journal of Intelligent Manufacturing. http://link.springer.com/article/10.1007/s10845-014-0869-8.
  • Gao, K. Z., P. N. Suganthan, Q. K. Pan, T. J. Chua, T. X. Cai, and C. S. Chong. 2014b. “Pareto-based Grouping Discrete Harmony Search Algorithm for Multi-objective Flexible Job Shop Scheduling.” Information Sciences 289: 76–90. http://www.sciencedirect.com/science/article/pii/S002002551400748810.1016/j.ins.2014.07.039.
  • Geem, Z. W. 2006. “Optimal Cost Design of Water Distribution Networks Using Harmony Search.” Engineering Optimization 38 (3): 259–277.10.1080/03052150500467430
  • Geem, Z. W., J. H. Kim, and G. V. Loganathan. 2001. “A New Heuristic Optimization Algorithm: Harmony Search.” Simulation 76 (2): 60–68.10.1177/003754970107600201
  • Jiang, Z. Q., L. Zuo, and E. M. C. 2014. “Study on Multi-objective Flexible Job Shop Scheduling Problem Considering Energy Consumption.” Journal of Industrial Engineering and Management 7 (3): 589–604.
  • Karthikeyan, S., P. Asokan, and S. Nickolas. 2014. “A Hybrid Discrete Firefly Algorithm for Multi-objective Flexible Job Shop Scheduling Problem with Limited Resource Constraints.” The International Journal of Advanced Manufacturing Technology 72 (9–12): 1567–1579.10.1007/s00170-014-5753-3
  • Kim, J. H., Z. W. Geem, and E. S. Kim. 2001. “Parameter Estimation of the Nonlinear Muskingum Model Using Harmony Search.” Journal of the American Water Resources Association 37 (5): 1131–1138.10.1111/jawr.2001.37.issue-5
  • Lee, K. S., and Z. W. Geem. 2005. “A New Meta-heuristic Algorithm for Continuous Engineering Optimization, Harmony Search Theory and Practice.” Computer Methods in Applied Mechanics and Engineering 194 (36–38): 3902–3933.10.1016/j.cma.2004.09.007
  • Lei, D. M. 2010a. “A Genetic Algorithm for Flexible Job Shop Scheduling with Fuzzy Processing Time.” International Journal of Production Research 48 (10): 2995–3013.10.1080/00207540902814348
  • Lei, D. M. 2010b. “Fuzzy Job Shop Scheduling Problem with Availability Constraints.” Computers & Industrial Engineering 58 (4): 610–617.10.1016/j.cie.2010.01.002
  • Lei, D. M. 2012. “Co-evolutionary Genetic Algorithm for Fuzzy Flexible Job Shop Scheduling.” Applied Soft Computing 12 (8): 2237–2245.10.1016/j.asoc.2012.03.025
  • Li, J. Q., and Q. K. Pan. 2012. “Chemical-reaction Optimization for Flexible Job-shop Scheduling Problems with Maintenance Activity.” Applied Soft Computing 12 (9): 2896–2912.10.1016/j.asoc.2012.04.012
  • Li, J. Q., Q. K. Pan, and K. Z. Gao. 2011. “Pareto-based Discrete Artificial Bee Colony Algorithm for Multi-objective Flexible Job Shop Scheduling Problems.” The International Journal of Advanced Manufacturing Technology 55 (9–12): 1159–1169.10.1007/s00170-010-3140-2
  • Mahdavi, M., M. Fesanghary, and E. Damangir. 2007. “An Improved Harmony Search Algorithm for Solving Optimization Problems.” Applied Mathematics and Computation 188 (2): 1567–1579.10.1016/j.amc.2006.11.033
  • Omran, M. G. H., and M. Mahdavi. 2008. “Global-best Harmony Search.” Applied Mathematics and Computation 198 (2): 643–656.10.1016/j.amc.2007.09.004
  • Pan, Q. K., P. N. Suganthan, M. F. Tasgetiren, and J. J. Liang. 2010. “A Self-adaptive Global Best Harmony Search Algorithm for Continuous Optimization Problems.” Applied Mathematics and Computation 216 (3): 830–848.10.1016/j.amc.2010.01.088
  • Pan, Q. K., P. N. Suganthan, J. J. Liang, and M. F. Tasgetiren. 2011. “A Local-best Harmony Search Algorithm with Dynamic Sub-harmony Memories for Lot-streaming Flow Shop Scheduling Problem.” Expert Systems with Applications 38 (4): 3252–3259.10.1016/j.eswa.2010.08.111
  • Pezzella, F., G. Morganti, and G. Ciaschetti. 2008. “A Genetic Algorithm for the Flexible Job-shop Scheduling Problem.” Computers & Operations Research 35 (10): 3202–3212.
  • Rossi, A. 2014. “Flexible Job Shop Scheduling with Sequence-dependent Setup and Transportation times by Ant Colony with Reinforced Pheromone Relationships.” International Journal of Production Economics 153 (7): 253–267.10.1016/j.ijpe.2014.03.006
  • Tasgetiren, M. F., O. Bulut, and M. M. Fadiloglu. 2012. “A Discrete Harmony Search Algorithm for the Economic Lot Scheduling Problem with Power of Two Policy.” Proceeding of 2012 IEEE Congress on Evolutionary Computation (CEC) 1–8. doi:10.1109/CEC.2012.6256592.10.1109/CEC.2012.6256592
  • Wang, S. J., and J. B. Yu. 2010. “An Effective Heuristic for Flexible Job Shop Scheduling Problem with Maintenance Activities.” Computers & Industrial Engineering 59 (3): 436–447.10.1016/j.cie.2010.05.016
  • Wang, L., Q. K. Pan, and M. F. Tasgetiren. 2010. “Minimizing the Total Flow Time in a Flow Shop with Blocking by Using Hybrid Harmony Search Algorithms.” Expert Systems with Applications 37 (12): 7929–7936.10.1016/j.eswa.2010.04.042
  • Wang, L., G. Zhou, Y. Xu, and M. Liu. 2013. “A Hybrid Artificial Bee Colony Algorithm for the Fuzzy Flexible Job Shop Scheduling Problem.” International Journal of Production Research 51 (12): 3593–3608.10.1080/00207543.2012.754549
  • Wang, S. Y., L. Wang, Y. Xu, and M. Liu. 2013. “An Effective Estimation of Distribution Algorithm for the Flexible Job Shop Scheduling Problem with Fuzzy Processing Time.” International Journal of Production Research 51 (12): 3778–3793.10.1080/00207543.2013.765077
  • Xia, W. J., and Z. M. Wu. 2005. “An Effective Hybrid Optimization Approach for Multi-objective Flexible Job-shop Scheduling Problems.” Computers & Industrial Engineering 48 (2): 409–425.10.1016/j.cie.2005.01.018
  • Xing, L. N., Y. W. Chen, P. Wang, Q. S. Zhao, and J. Xiong. 2010. “A Knowledge-based Ant Colony Optimization for Flexible Job Shop Scheduling Problems.” Applied Soft Computing 10 (3): 888–896.10.1016/j.asoc.2009.10.006
  • Yazdani, M., M. Amiri, and M. Zandieh. 2010. “Flexible Job-shop Scheduling with Parallel Variable Neighborhood Search Algorithm.” Expert Systems with Applications 37 (1): 678–687.10.1016/j.eswa.2009.06.007
  • Yuan, Y., and Hua Xu. 2013. “A Hybrid Harmony Search Algorithm for the Flexible Job Shop Scheduling Problem.” Applied Soft Computing 13 (7): 3259–3272.10.1016/j.asoc.2013.02.013
  • Zhang, G. H., X. Y. Shao, P. G. Li, and L. Gao. 2009. “An Effective Hybrid Particle Swarm Optimization Algorithm for Multi-objective Flexible Job-shop Scheduling Problem.” Computers & Industrial Engineering 56 (4): 1309–1318.10.1016/j.cie.2008.07.021

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.