Abstract
This paper deals with the problem of optimization of job sequence in a two-machine flow shop problem in the presence of uncertainty. It is assumed that the processing times of jobs on the machines are described by triangular fuzzy sets. A new optimization algorithm based on Johnson”s algorithm for deterministic processing times and on an improvement of McCahon and Lee”s algorithm is developed and presented. In order to compare fuzzy processing times, McCahon and Lee use mean values of their corresponding fuzzy sets. It is shown that this approach cannot fully explore possible relationships between fuzzy sets. In order to overcome this drawback we consider different fuzzy sets determined by λ-cuts of the fuzzy processing times. Extensive experiments show that the new algorithm gives better solutions with respect to makespan than existing McCahon and Lee's algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bortolan V, Degani R (1985) A review of some methods for ranking fuzzy numbers. Fuzzy Sets Syst 15:1–19
Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n-jobm-machine sequencing problem. Manage Sci 16:630–637
Chanas S, Kasperski A, Kuchta D (2000) Two approaches to fuzzy flow shop problem. In: Slowinski R, Hapke M (eds) Scheduling under fuzziness. Physica-Verlag, Heidelberg, pp 165–195
Dubois D, Prade H (1978) Operations on fuzzy numbers. Int J Syst Sci 9(6):613–626
Dubois D, Prade H (1979) Ranking of fuzzy numbers in the setting of possibility theory. Inf Sci 30:183–224
Dubois D, Fargier H, Prade H (1995) Fuzzy constraints in job-shop scheduling. J Intelligent Manufacturing 6:215–234
Dubois D, Fargier H, Fortemps P (2003) Fuzzy scheduling: modelling flexible constraints vs. coping with incomplete knowledge. Eur J Oper Res 147:231–252
Fortemps, P (1997) Job-shop scheduling with imprecise durations: a fuzzy approach. IEEE Trans Fuzzy Syst 5:557–569
Hong T, Chuang T (1999) New triangular fuzzy Johnson algorithm. Comput Ind Eng 36(1):179–200.
Ishibuchi H, Murata T (2000) Flowshop scheduling with fuzzy duedate and fuzzy processing time. In: Slowinski R, Hapke M (eds) Scheduling under fuzziness, Physica-Verlag, Heidelberg, pp 113–143.
Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Res Logistics Q 1:61–68
Kaufmann A, Gupta MM (1985) Introduction to fuzzy arithmetic. Van Nostrand Reinhold, New York
Lee ES, Li RJ (1988) Comparison of fuzzy numbers based on the probability measure of fuzzy event. Comput Math Appl 15:887–896
McCahon CS, Lee ES (1992) Fuzzy job sequencing for a flow shop. Eur J Oper Res 62:294–301
McCahon S, Lee ES (1990) Job sequencing with fuzzy processing times. Comput Math Appl 19(7):31–41
Morton TE, Pentico DW (1993) Heuristic scheduling systems with applications to production systems and project management. John Wiley & Sons Inc., New York
Pedrycz W, Gowide F (1998) An introduction to fuzzy sets – analysis and design. The MIT Press
Yager RR (1981) A procedure for ordering fuzzy subsets of the unit interval. Inf Sci 24:143–161
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Petrovic, S., Song, X. A new approach to two-machine flow shop problem with uncertain processing times. Optim Eng 7, 329–342 (2006). https://doi.org/10.1007/s11081-006-9975-6
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11081-006-9975-6