A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

European Journal of Operational Research

Volumn 96, Issue 3, 1997, Pages 578-590

  Cheng, Jinliang ^a   Kise, Hiroshi ^a   Matsumoto, Hironori ^b  

^a KYOTO INSTITUTE OF TECHNOLOGY   (Japan)

^b SUMITOMO ELECTRIC INDUSTRIES LTD   (Japan)

Author keywords

Branch and bound algorithm; Dominance relation; Fuzzy inference; Permutation flowshop; Scheduling theory

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FLEXIBLE MANUFACTURING SYSTEMS; FUZZY SETS; MACHINERY; MEMBERSHIP FUNCTIONS; MONTE CARLO METHODS; OPTIMIZATION; PROBABILITY;

BRANCH AND BOUND ALGORITHM; DOMINANCE RELATION; FUZZY INFERENCE; PERMUTATION FLOWSHOP; SCHEDULING THEORY;

SCHEDULING;

EID: 0031075891     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0377-2217(96)00083-5     Document Type: Article

References (32)

1. Agnetis, A., Arbib, C., and Stecke, K.E., "Optimal two-machine scheduling in a flexible flow system", in: Proceedings of the Second International Conference on Computer Integrated Manufacturing, Rensselaer Polytechnic Institute, Rensselaer, NY, May 21-23, 1990.
2. Ashour, S., "A branch-and-bound algorithm for the flowshop scheduling problem", AIIE Transactions 2 (1970) 172-176.
3. Baker, K.R., "A comparative survey of flowshop algorithms", Operations Research 23 (1975) 62-73.
4. Blazewicz, J., Ecker, K., Schmidt, G., and Weglarz, J., Scheduling in Computer and Manufacturing Systems, Springer Verlag, Berlin, 1993.
5. Brown, A., and Lomnicki, Z., "Some applications of the branch-and-bound algorithm to the machine scheduling problem", Operations Research Quarterly 17 (1966) 173-186.
6. Carlier, J., "The one machine sequencing problem", European Journal of Operational Research 11 (1982) 42-47.
7. Cheng, J., Kise, H., and Matsumoto, H., "A branch-and-bound algorithm with fuzzy inference for the 3-machine flowshop scheduling problem", in: Proceedings of 1994 Japan-U.S.A. Symposium on Flexible Automation - A Pacific Rim Conference, Kobe, Japan, July 11-18, 1994, 791-797.
8. Dudek, R.A., Panwalkar, S.S., and Smith, M.L., "The lessons of flowshop scheduling research", Operations Research 40 (1992) 7-13.
9. Dudek, R.A., and Teuton, O.F. "Development of m-stage decision rule for scheduling n jobs through m machines", Operations Research 12 (1964) 471-497.
10. Garey, M.R., Johnson, D.S., and Sethi, R.R., "The complexity of flowshop and job shop scheduling", Mathematics of Operations Research 1 (1976) 117-129.
11. Ibaraki, T., "Enumerative approaches to combinatorial optimization, Part I", Annals of Operations Research 10 (1987).
12. Ibaraki, T., "Enumerative approaches to combinatorial optimization, Part II", Annals of Operations Research 11 (1987).
13. Ignall, E., and Schrage, L.E., "Application of the branch-and-bound technique to some flowshop scheduling problems", Operations Research 13 (1965) 400-412.
14. Johnson, S.M., "Optimal two-and three-stage production schedules with setup times included", Naval Research Logistics Quarterly 1 (1954) 61-68.
15. Kise, H., "On an automated two-machine flowshop scheduling problem with infinite buffer", Journal of the Operations Research Society of Japan 34 (1991) 354-361.
16. Kise, H., Kohno, K., Shioyama, T., and Kushiyama, T., "Optimal scheduling for an automated two-machine manufacturing system", Japanese Journal of Advanced Automation Technology 4 (1992) 121-127.
17. Lageweg, B.J., Lenstra, J.K., and Rinnooy Kan, A.H.G., "A general bounding scheme for the permutation flowshop problem", Operations Research 26 (1978) 53-67.
18. Lomnicki, Z., "A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem", Operations Research Quarterly 16 (1965) 89-100.
19. McMahon, G.B., and Burton, P.G., "Flowshop scheduling with the branch and bound method", Operations Research 15 (1967) 473-481.
20. Nabeshima, I., "On the bound of makespans and its application in m machine scheduling problem", Journal of the Operations Research Society of Japan 9 (1967) 98-130.
21. Nabeshima, I., Scheduling Theory, Morikita Syuppan, 1974 (in Japanese).
22. Padberg, M.W., and Rinaldi, G., "A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problem", SIAM Review 33 (1991) 60-100.
23. Panwalkar, S.S., and Khan, A.W., "An improved branch and bound procedure for n × m flowshop problems", Naval Research Logistics Quarterly 22 (1975) 787-790.
24. Potts, C.N., and Van Wassenhove, L.N., "Algorithm for scheduling a single machine to minimize the weighted number of late jobs", Management Science 34 (1988) 843-858.
25. Srikandarajah, C., and Sethi, S.P., "Scheduling algorithms for flexible flowshops: worst and average case performance", European Journal of Operational Research 43 (1989) 143-160.
26. Stern, H.I., and Vitner, G., "Scheduling parts in a combined production-transportation work cell", Journal of the Operational Research Society, 41 (1990) 625-632.
27. Suhl, U., "An algorithm and efficient data structure for the binary knapsack problem", European Journal of Operational Research 2 (1978) 420-428.
28. Szwarc, W., "Optimal elimination methods in the m × n flowshop scheduling problem", Operations Research 21 (1973) 1250-1259.
29. Szwarc, W., "Mathematical aspect of the 3 × n jobshop sequencing problem", Naval Research Logistics Quarterly 21 (1974) 145-153.
30. Szwarc, W., and Hutchingson, G.E., "Johnson's approximate method for 3 × n jobshop problem", Naval Research Logistics Quarterly 24 (1977) 153-157.
31. Taillard, E., "Benchmarks for basic scheduling problems," European Journal of Operational Research, 64 (1993) 278-285.
32. Zijm, W.H.M., and Nelissen, E.H.L.B., "Scheduling a flexible manufacturing center", Engineering Costs and Production Economics 19 (1990) 249-258.