CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Hybrid Fuzzy Adaptive Particle Swarm Optimization Algorithm for Fuzzy Job Shop Scheduling Problem (FJSSP)

by Aylin Pakzad, Malek Tajadod
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 91 - Number 3
Year of Publication: 2014
Authors: Aylin Pakzad, Malek Tajadod
10.5120/15863-4792

Aylin Pakzad, Malek Tajadod . Hybrid Fuzzy Adaptive Particle Swarm Optimization Algorithm for Fuzzy Job Shop Scheduling Problem (FJSSP). International Journal of Computer Applications. 91, 3 ( April 2014), 34-38. DOI=10.5120/15863-4792

@article{ 10.5120/15863-4792,
author = { Aylin Pakzad, Malek Tajadod },
title = { Hybrid Fuzzy Adaptive Particle Swarm Optimization Algorithm for Fuzzy Job Shop Scheduling Problem (FJSSP) },
journal = { International Journal of Computer Applications },
issue_date = { April 2014 },
volume = { 91 },
number = { 3 },
month = { April },
year = { 2014 },
issn = { 0975-8887 },
pages = { 34-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume91/number3/15863-4792/ },
doi = { 10.5120/15863-4792 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:12:20.953980+05:30
%A Aylin Pakzad
%A Malek Tajadod
%T Hybrid Fuzzy Adaptive Particle Swarm Optimization Algorithm for Fuzzy Job Shop Scheduling Problem (FJSSP)
%J International Journal of Computer Applications
%@ 0975-8887
%V 91
%N 3
%P 34-38
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The processing time for each job in JSSP is often imprecise in many real world applications. Therefore, JSSP with fuzzy processing time was addressed in this paper. Triangular fuzzy numbers were used to describe the fuzzy processing time. In this paper, a hybrid particle swarm optimization (HPSO) algorithm was presented for solving JSSP. The quality of the PSO algorithm final solution depends on two factors: the quality of initial solutions and adjustment of PSO parameters. In this study, to improve the quality of initial solutions, a constructive greedy randomized adaptive search procedure (GRASP) algorithm was proposed. Furthermore, in order to adjust HPSO parameters, a fuzzy interference system was applied to compute these parameters at each iteration of HPSO. Therefore, the presented algorithm in this study was called hybrid fuzzy adoptive PSO (HFAPSO). Benchmarks with fuzzy processing time were used for testing the presented algorithm.

References
  1. A. S. Jain, and S. Meeran, "Deterministic job-shop scheduling: Past, present and future", European Journal of Operational Research, 1999, 113(2). pp. 390–434.
  2. M. R. Garey, D. S, Johnson, and R. Sethi, "The complexity of flowshop and jobshop scheduling", Mathematics of Operations Research, 1976, 1(2),pp. 117–129.
  3. B. J. Park, H. R. Choi, and H. S. A. Kim, "A hybrid genetic algorithm for the job shop scheduling problems", Computers and Industrial Engineering, 2003, 45(4), pp. 597–613.
  4. P. J. M. V. Laarhoven, E. H. L. Aarts, and J. K. Lenstra, "Job shop scheduling by simulated annealing", Operations Research, 1992, 40(1), pp. 113–125.
  5. Ge, H. W. Du, W. and Qian, F. 2007. A hybrid algorithm based on particle swarm optimization and simulated annealing for job shop scheduling. In Proceedings of the third international conference on natural computation, 3, pp. 715– 719.
  6. X. J. Wei, and Z. M. Wu, "An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems", Computers and Industrial Engineering, 2005, 48(2), pp. 409–425.
  7. P. Fortemps, " Job shop scheduling with imprecise durations: a fuzzy approach", IEEE Transactions on Fuzzy Systems, 1997, 5(4), pp. 557–569.
  8. L. Deming, "Fuzzy job shop scheduling problem with availability constraints", Computers & Industrial Engineering, 2010, 58(4), pp. 610–617.
  9. A. Mahmodi Nejad, and M. Mashinchi,"Ranking fuzzy numbers based on the areas on the left and the right sides of fuzzy number", Computers and Mathematics with Applications, 2011, 61(2), pp. 431–442.
  10. J. Giffler, and G. L. Thompson, "Algorithms for solving production scheduling problems", Operations Research, 1960, 8(4), pp. 487–503.
  11. Kennedy, J. and Eberhart, R. 1995. Particle Swarm OptimizationIn: Proceedings of the 1995 IEEE international conference on neural networks. New Jersey: IEEE Press. pp. 1942–1948.
  12. Knuth, D. 1997. Semi numerical algorithms (3rd ed). The art of computer programming (Vol. 2). Addison-Wesley Longman Publishing Co. , Inc. Boston, MA, USA.
  13. A. G. Omar, "A bi-criteria optimization: minimizing the integral value and spread of the fuzzy makespan of job shop scheduling problems", Applied Soft Computing, 2003, 2, pp. 197–210.
  14. Q. Niu, B. Jiao, and X. Gu, "Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time", Applied Mathematics and Computation, 2008, 205(1), pp. 148–158.
Index Terms

Computer Science
Information Sciences

Keywords

Fuzzy interference system Fuzzy job shop scheduling problem Greedy randomized adaptive search procedure Hybrid Particle Swarm Optimization.

Powered by PhDFocusTM