Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time

Applied Mathematics and Computation

Volumn 205, Issue 1, 2008, Pages 148-158

  Niu, Qun ^a,b   Jiao, Bin ^c   Gu, Xingsheng ^a  

^a EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b SHANGHAI UNIVERSITY   (China)

^c SHANGHAI DIANJI UNIVERSITY   (China)

Author keywords

Fuzzy sets; Genetic algorithm; Job shop scheduling; Makespan; Particle swarm optimization (PSO); Processing time

Indexed keywords

ALGORITHMS; ANIMAL CELL CULTURE; APPLICATIONS; BENCHMARKING; BOOLEAN FUNCTIONS; FUZZY RULES; FUZZY SETS; GENETIC ALGORITHMS; NUCLEAR PROPULSION; OPTIMIZATION; POPULATION STATISTICS; PROBLEM SOLVING; SCHEDULING; SET THEORY;

CROSSOVER AND MUTATIONS; FORMULATED PROBLEMS; FUZZY PROCESSING TIMES; GENETIC OPERATORS; HUMAN SOCIAL INTERACTIONS; JOB SEQUENCES; JOB SHOP SCHEDULING; JOB-SHOP SCHEDULING PROBLEMS; MAKESPAN; NP-HARD PROBLEMS; OPTIMIZATION METHODS; PARTICLE SWARMS; PROCESSING TIME; PROCESSING TIMES; RANKING FUZZY NUMBERS; SCHEDULING PROBLEMS; TRIANGULAR FUZZY NUMBERS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 54049092772     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2008.05.086     Document Type: Article

References (37)

1. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. Sequencing and Scheduling: Algorithms and Complexity. Operations Research and Management Science vol. 4 (1989), CWI, Amsterdam
2. Muth F., and Thompson G.L. Industrial Scheduling (1963), Prentice Hall, Englewood Cliffs, New Jersey
3. Conway R.W., Maxwell W.L., and Miller LW. Theory of Scheduling (1967), Addison-Wesley, Reading, Mass
4. Baker K.R. Introduction to Sequencing and Scheduling (1974), Wiley & Sons
5. French S. Sequencing and Scheduling: An introduction to the Mathematics of the Job-Shop (1982), Horwood
6. Blazewicz J. Selected topics in scheduling theory. Annals of Discrete Mathematics 31 (1987) 1-6
7. Fortemps P. Job shop scheduling with imprecise durations: a fuzzy approach. IEEE Transactions on Fuzzy Systems 5 4 (1997) 557-569
8. McCahon C.S., and Lee E.S. Job sequencing with fuzzy processing times. Computers and Mathematics with Applications 19 (1990) 31-41
9. In: Slowinski R., and Hapke M. (Eds). Scheduling Under Fuzziness (2000), Physica-Verlag, Heidelberg
10. Chanas S., and Kasperski A. Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing times and fuzzy due dates. Engineering Applications of Artificial Intelligence 143 (2001) 377-386
11. Litoiu M., and Tadei R. Real-time task scheduling with fuzzy deadlines and processing times. Fuzzy Sets and Systems 117 (2001) 35-45
12. Nezhad S.S., and Assadi R.G. Preference ratio-based maximum operator approximation and its application in fuzzy flow shop scheduling. Applied Soft Computing 8 (2008) 759-766
13. Ishibuchi H., Yamamoto N., Misaki S., and Tanaka H. Local search algorithms for flow shop scheduling with fuzzy due-dates. International Journal of Production Economics 33 (1994) 53-66
14. R.M. Kerr, W. Slany, Research issues and challenges in fuzzy scheduling. Christian Doppler Laboratory for Expert Systems Tech, University Vienna, Vienna, Austria, CD-Tech. Rep. 94-68, 1994.
15. R. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, in: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995, pp. 39-43.
16. Clerc M. Discrete particle swarm optimization, illustrated by the traveling salesman problem. New Optimization Techniques in Engineering (2004), Springer, Heidelberg, Germany 219-239
17. Liu B., Wang L., and Jin Y.H. An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Transactions on Systems, Man and Cybernetics - Part B: Cybernetics 37 1 (2007) 18-27
18. Lian Z., Gu X., and Jiao B. A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation 183 (2006) 1008-1017
19. Wei X.J., and Wu Z.M. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering 48 (2005) 409-425
20. Lian Z., Gu X., and Jiao B. A similar particle swarm optimization algorithm for permutation flow shop scheduling to minimize makespan. Applied Mathematics and Computation 175 (2006) 773-785
21. Zadeh A. Fuzzy sets. Information Control 8 (1965) 338-353
22. Yager R.R. A procedure for ordering fuzzy subsets of the unit interval. Information Sciences 24 (1981) 143-161
23. Dubois D., and Prade H. Ranking fuzzy numbers in the setting of possibility theory. Information Sciences 30 (1983) 183-224
24. Chen S.H. Ranking fuzzy numbers with maximizing set and minimizing set. Fuzzy Sets and Systems 17 (1985) 113-129
25. Lee E.S., and Li R.J. Comparison of fuzzy numbers based on the probability measure of fuzzy events. Computers and Mathematics with Applications 15 (1988) 887-896
26. Y. Zheng, L. Ma, L. Zhang, J. Qian, Robust PID controller design using particle swarm optimizer, in: IEEE International Symposium on Intelligence Control, 2003, pp. 974-979.
27. Abido M. Optimal design of power system stabilizers using particle swarm optimization. IEEE Transaction on Energy Conversion 17 3 (2002) 406-413
28. Fourie P., and Groenwold A. The particle swarm optimization algorithm in size and shape optimization. Structural and Multidisciplinary Optimization 23 4 (2002) 259-267
29. Holland J.H. Outline for a logical theory of adaptive systems. Journal of the Association for Computing Machinery 9 3 (1962) 297-314
30. Gen M., and Cheng R. Genetic Algorithms and Engineering Design (1997), Wiley, New York
31. Peng J., Li K., Thompson S., and Wieringa P.A. Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems. Applied Mathematics and Computation 185 (2007) 1063-1077
32. Haupt R.L. Thinned arrays using genetic algorithms. IEEE Transactions on Antennas Propagation 42 7 (1994) 993-999
33. Chatterjee S., Carrera C., and Lynch L. Genetic algorithms and traveling salesman problems. European Journal of Operational Research 93 (1996) 490-510
34. Omar A.G. A bi-criteria optimization: minimizing the integral value and spread of the fuzzy makespan of job shop scheduling problems. Applied Soft Computing 2 (2003) 197-210
35. Fischer H., and Thompson G. Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules, Industrial Scheduling (1963), Prentice Hall, Englewood Cliffs, New Jersey, USA pp. 225-251
36. S. Lawrence, Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Technique, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, USA, 1984.
37. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job-shop scheduling. Management Science 34 (1988) 391-401