A genetic algorithm for fuzzy order acceptance and scheduling problem

Abstract

In light of the imprecise and fuzzy nature of real production environments, theorder acceptance and scheduling (OAS) problem is associated with fuzzyprocessing times, fuzzy sequence dependent set up time and fuzzy due dates. Inthis study, a genetic algorithm (GA) which uses fuzzy ranking methods isproposed to solve the fuzzy OAS problem. The proposed algorithm is illustratedand analyzed using examples with different order sizes. As illustrative numericalexamples, fuzzy OAS problems with 10, 15, 20, 25, 30 and 100 orders areconsidered. The feasibility and effectiveness of the proposed method aredemonstrated. Due to the NP-hard nature of the problem, the developed GA hasgreat importance to obtain a solution even for big scale fuzzy OAS problem.Also, the proposed GA can be utilized easily by all practitioners via thedeveloped user interface.