00

00

00

00

00

00

00

1. support 9. ready time
2. flow shop 10. due date
3. scheduling 11. preemption
4. sequencing 12. makespan
processing time13. completion time

crisp14. permutation

interval

15. mean flow time
935799-2909592

929703-4378868

-42674-2397479

possibility
membership function
ranking
generalized mean value (GMV)
pessimistic
risk averse
most likely
8. fuzzy numbers16. heuristic
Baker, K. R., Introduction to Sequencing and Schedul

-ing,” John Wiley, New York, 1979.
French, S., Sequencing and Scheduling: An Introduc

-tion to the Mathematics of the Job Shop, Ellis Horwood Limited, England, 1986.
Garey, M. R., Johnson, D. S., and sethi, R., “The
Complexity of Flow Shop and job Shop Scheduling,” Mathematics of Operations Research Vole 1, PP. 117-129, 1976.
Rinnooy Kan, A. H. G., Machine Scheduling

Problems: Classification, Complexity and Computations, Martinus Nijhoff, The Hague, 1976.

24. partial sequence
Campbell, H. G., Dudek, R. A., and Smith, M.L., t’A
Heuristic Algorithm for the n Job, m Machine

Sequencing problem,” Management Science, Vol. 16, PP. B630-B637, 1970.
Johnson, S. M., “Optimal and Three Stage
Production Schedules with Setup Times Included,”

Naval Research Logistics Quarterly, Vol. 6, PP. 61-68, 1954.
McCahnon, C. St, Lee E.,”Fuzzy Job Sequencing for Flow Shop,t’ European Journal of Operational Research, pp.294-301,1992.
Nawaz, M., Emscore Jr, E. E., and Ham, I. , “A Heuristic Algorithm for the m-Machine, n-Job Flow shop sequencing Problems.” Omega Vol. 11, PP. 91-95, 1983.
Reeves, C. R., “A Genetic Algorithm for Flow Shop Sequencing,”Computers & Operational Research vol. 22, No. 1, PP. 5-13, 1995.
49807679788058

Zimmermann H. J., Fuzzy Set Theo)),’ and Its Applications, Kluwer, USA, 1991.
Lee, E. S., Li, R. J.,” Comparison of Fuzzy Numbers Based on Probabillity Measure of Fuzzy Events, “Computers and Mathematics with Applications, vol. 15, pp. 887-8 96, 1988.



قیمت: تومان


پاسخ دهید