Abstract
This paper addresses job shop scheduling problems with fuzzy processing time and fuzzy trapezoid or doublet due date. An efficient random key genetic algorithm (RKGA) is suggested to maximize the minimum agreement index and to minimize the maximum fuzzy completion time. In RKGA, a random key representation and a new decoding strategy are proposed and two-point crossover (TPX) and discrete crossover (DX) are considered. RKGA is applied to some fuzzy scheduling instances and performance analyses on random key representation, and the comparison between RKGA and other algorithms are done. Computation results validate the effectiveness of random key representation and the promising advantage of RKGA on fuzzy scheduling.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kuroda M, Wang Z (1996) Fuzzy job shop scheduling. Int J Prod Econ 44(1):45–51
Sakawa M, Mori T (1999) An efficient genetic algorithm for job shop scheduling problems with fuzzy processing time and fuzzy due date. Comput Ind Eng 36(2):325–341
Sakawa M, Kubota R (2000) Fuzzy programming for multi-objective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithm. Eur J Oper Res 120(2):393–407
Song XY, Zhu YL, Yin CW, Li FM (2006) Study on the combination of genetic algorithms and ant colony algorithms for solving fuzzy job shop scheduling problems. In Proceedings of the IMACS Multi-Conferences on Computational Engineering in Systems Applications, Beijing, pp 1904–1909
Lei DM (2007) Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems. Int J Adv Manuf Technol 37(1–2):157–165
Li FM, Zhu YL, Yin CW, Song XY (2005) Fuzzy programming for multi-objective fuzzy job shop scheduling with alternative machines through genetic algorithm. In: Wang L, Chen K, Ong YS (eds) Advance in natural computation. Springer, Berlin, pp 992–1004
Giffler B, Thompson GL (1960) Algorithm for solving production scheduling problems. Oper Res 8:487–503
Wu C-S, Li D-C, Tsai T-I (2006) Applying the fuzzy ranking method to the shifting bottleneck procedure to solve scheduling problems of uncertainty. Int J Adv Manuf Technol 31(1–2):98–106
Bean J (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154–160
Cheng RW, Gen M, Tsujimura Y (1996) A tutorial survey of job-shop scheduling problems using genetic algorithms: I. Representation. Comput Ind Eng 30(4):983–997
Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins G (ed) Foundations of genetic algorithms. Morgan Kaufmann, San Francisco
Bierwirth C (1995) A generalized permutation approach for job shop scheduling with genetic algorithms. OR Spektrum 17(1):87–92
Bierwirth C, Mattfeld D, Kopfer H (1996) On permutation representations for scheduling problems. In: Voigt HM (ed) Proceedings of parallel problem solving from nature IV. Springer, Berlin, pp 310–318
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lei, D. Solving fuzzy job shop scheduling problems using random key genetic algorithm. Int J Adv Manuf Technol 49, 253–262 (2010). https://doi.org/10.1007/s00170-009-2379-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-009-2379-y