An improved genetic-based particle swarm optimization for no-idle permutation flow shops with fuzzy processing time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4099 LNAI, Issue , 2006, Pages 757-766

  Niu, Qun ^a   Gu, Xingsheng ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER SIMULATION; GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

FUZZY PROCESSING TIME; GENETIC OPERATIONS; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING PROBLEMS;

FUZZY CONTROL;

EID: 33749556766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11801603_80     Document Type: Conference Paper

References (24)

1. Adiri, I., & Pohoryles, D. Flow-shop/no-idle or no-wait scheduling to minimise the sum of completion times. Naval Research Quarterly, 29(1982) 495-504.
2. Garey, M. R., Johnson, D. S., & Sethi, R. The complexity of flow-shop and job-shop scheduling. Mathematics of Operational Research, 1(1976) 117-129.
3. Baptiste, P., & Hguny, L. K. A branch and bound algorithm for the F=no-idle=C max (Vol. 1). Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM'97), Lyon, (1997) pp. 429-438.
4. Tanarv, V. S., Sotskov, Y. N., & Strvsevitch, V. A. Scheduling theory multi-stage system. Dordrecht: Kluwer Academic Publishers. (1994)
5. Giaro, K. NP-hardness of compact scheduling in simplified open and flow shops. European Journal of Operational Research, 130 (2001) 90-98.
6. Narasimhan, S. L., & Mangiameli, P. M. A comparison of sequencing rules for a two-stage hybrid flow-shop. DecisionSciences, 18 (1987) 250-265.
7. Prade H.: Using fuzzy set theory in a scheduling problem: a case study. Fuzzy Sets and Systems. 2 (1979) 153-165.
8. Slowinski R., Hapke M.: Scheduling Under Fuzziness. Heidelberg. (2000)
9. Fortemps P.: Jobshop scheduling with imprecise durations: a fuzzy approach. IEEE Trans. Fuzzy Syst. 5 (1997) 557-569.
10. McCahon S., Lee E. S.: Job sequencing with fuzzy processing times. Computers and Mathematics with Applications. 19 (1990) 31-41.
11. Chanas S., Kasperski A.: Minimizing Maximum Lateness in a Single Machine Scheduling Problem with Fuzzy Processing times and Fuzzy Due Dates. Engineering Applications of Artificial Intelligence. 14 (2001) 377-386.
12. Litoiu M., Tadei R.: Real-time task scheduling with fuzzy deadlines and processing times. Fuzzy Sets and Systems. 117 (2001) 35-45.
13. Hong Tzungpei, Wang Tzutin.: Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains. Information Sciences. 129 (2000) 227-237
14. Zadeh, L.A. Fuzzy sets. Information and Control. 8 (1965) 338-353.
15. Yager, R.R. A procedure for ordering fuzzy subsets of the unit interval, Information Sciences 24 (1981) 143-161.
16. Dubois, D. and Prade, H. Ranking fuzzy numbers in the setting of possibility theory, Information Sciences 30 (1983) 183-224.
17. Chen, S.H. Ranking fuzzy numbers with maximizing set and minimizing set, Fuzzy Sets and Systems 17 (1985) 113-129.
18. Lee E.S., Li R.J.: Comparison of fuzzy numbers based on the probability measure of fuzzy events. Computers & Mathematics with Applications. 15 (1988) 887-896.
19. Lee E.S., Li R.J.: Comparison of fuzzy numbers based on the probability measure of fuzzy events. Computers & Mathematics with Applications. 15 (1988) 887-896.
20. Eberhart R. C., Kennedy J.: A new optimizer using particle swarm theory. In Proc. 6th Int. Symp. Micro Machine and Human Science, Nagoya, Japan. (1995) 39-43.
21. Laskari E. C., Parsopoulos K. E., Vrahatis M. N.: Particle swarm optimization for minimax problems. In Proc. IEEE 2002 Congr. Evolutionary Computation Honolulu. (2002) 1582-1587.
22. Mostaghim S., Teich J.: Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO). In Proc. IEEE 2003 Swarm Intelligence Symp. (2002) 26-33.
23. Clerc M.: Discrete particle swarm optimization, illustrated by the Traveling Salesman Problem. New Optimization Techniques in Engineering. Springer, Heidelberg Germany, pp. (2004) 219-239.
24. 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. (2003) 197-210.