Skip to main content
Log in

Fuzzy branch-and-bound algorithm for flow shop scheduling

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

Scheduling is the allocation of resources over time to perform a collection of task. It is an important subject of production and operations management area. For most of scheduling problems made so far, the processing times of each job on each machine and due dates have been assigned as a real number. However in the real world, information is often ambiguous or imprecise. In this paper fuzzy concept are applied to the flow shop scheduling problems. The branch-and-bound algorithm of Ignall and Schrage was modified and rewritten for three-machine flow shop problems with fuzzy processing time. Fuzzy arithmetic on fuzzy numbers is used to determine the minimum completion time (C max). Proposed algorithm gets a scheduling result with a membership function for the final completion time. With this membership function determined, a wider point of view is provided for the manager about the optimal schedule.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Adamopoulos, G. I. and Pappis, C. P. (1996) A fuzzy-linguistic approach to a multi-criteria sequencing problem. European Journal of Operational Research, 92, 628–636.

    Google Scholar 

  • Baker, K. R. (1994) Elements of Sequencing and Scheduling, Amos Tuck School of Business Administration.

  • Brucker, P. (1995) Scheduling Algorithm, Springer-Verlag.

  • Cheng, J., Kise, H. and Matsumoto, H. (1994) A branch-and-bound algorithm with fuzzy inference for a permutation flow shop scheduling problem. European Journal of Operational Research, 96, 578–590.

    Google Scholar 

  • Dubois, D., Fargier, H. and Prade, H. (1995) Fuzzy constraints in job-shop scheduling. Journal of Intelligent Manufacturing, 6, 215–234.

    Google Scholar 

  • Dumitru, V. and Luban, F. (1982) Membership functions, some mathematical programming models and production scheduling. Fuzzy Sets and Systems, 8, 19–33.

    Google Scholar 

  • Han, S., Ishii, H. and Fujii, S. (1994) One machine scheduling problem with fuzzy due dates. European Journal of Operational Research, 79, 1–12.

    Google Scholar 

  • Hong, T., Huang, C. and Yu, K. (1995) Fuzzy LPT algorithm for scheduling. IEEE International Conference on Systems, Man and Cybernetics, pp. 2588–2592.

  • Hong, T. and Chuang, T. (1996a) A fuzzy CDS scheduling algorithm. IEEE Conference on Emerging Technologies and Factory Automation, ETFA'96, pp. 528–532.

  • Hong, T. and Chuang, T. (1996b) Fuzzy Johnson's algorithm for two-machine flow shop. The Ninth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert System, Japan.

  • Ignall, E. and Schrage, L.E. (1965) Application of the branch and bound technique to some flow shop scheduling problems. Operations Research, 13, 400–412.

    Google Scholar 

  • Ishibuchi, H., Yamamoto, N., Misaki, S. and Tanaka, H. (1994a) Local search algorithms for flow shop scheduling with fuzzy due-dates. International Journal of Production Economics, 33, 53–66.

    Google Scholar 

  • Ishibuchi, H., Yamamoto, N., Murata, T. and Tanaka, H. (1994b) Genetic algorithms and neighborhood search algorithms for fuzzy flow shop scheduling problems. Fuzzy Sets and Systems, 67, 81–100.

    Google Scholar 

  • Ishibuchi, H., Murata, T. and Lee, K. (1996) Formulation of fuzzy flow shop scheduling problems with fuzzy processing time. Proceedings of The 5th IEEE International Conference on Fuzzy Systems, New Orleans, USA, pp. 199–205.

  • Ishii, H., Tada, M. and Masuda, T. (1992) Two scheduling problems with fuzzy due-dates. Fuzzy Sets and Systems, 46, 339–347.

    Google Scholar 

  • Ishii, H. and Tada, M. (1995) Single machine scheduling problem with fuzzy precedence relation. European Journal of Operational Research, 87, 284–288.

    Google Scholar 

  • Kuroda, M. and Wang, Z. (1996) Fuzzy job shop scheduling. International Journal of Production Economics, 44, 45–51.

    Google Scholar 

  • Lee, E. S. and Li, R.-J. (1988) Comparison of fuzzy numbers based on probability measure of fuzzy events. Computers and Mathematics with Applications, 15, 887–896.

    Google Scholar 

  • McCahon, C. S. and Lee, E. S. (1990) Job sequencing with fuzzy processing times. Computers and Mathematics with Applications, 19, 31–41.

    Google Scholar 

  • McCahon, C. S. and Lee, E. S. (1992) Fuzzy job sequencing for a flow shop. European Journal of Operational Research, 62, 294–301.

    Google Scholar 

  • Murata, T., Ishibuchi, H. and Lee, K. (1996) Application of two-objective genetic algorithm to flow shop scheduling problems with interval processing time. Proceedings of EUFIT'96, Aachen, Germany, pp. 443–447.

  • Murata, T., Ishibuchi, H. and Lee, K. (1997) Reformulation of various non-fuzzy scheduling problems using the concept o fuzzy due-date. Proceedings of the 6th IEEE International Conference on Fuzzy Systems, Barcelona, Spain, pp. 447–452.

  • Stanfield, P. M., King, R. E. and Joines, J. A. (1996) Scheduling arrivals to a production system in a fuzzy environment. European Journal of Operational Research, 93, 75–87.

    Google Scholar 

  • Watanabe, T., Tokumaru, H., Nakajima, Y. and Hashimoto, Y. (1992) Job-shop scheduling using fuzzy inference to take profit into account. Proceedings of the 1992 Japan–USA Symposium on Flexible Automation, New York, USA, pp. 423–427.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Temİz, İ., Erol, S. Fuzzy branch-and-bound algorithm for flow shop scheduling. Journal of Intelligent Manufacturing 15, 449–454 (2004). https://doi.org/10.1023/B:JIMS.0000034107.72423.b6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JIMS.0000034107.72423.b6

Navigation