{"title":"A genetic algorithm for fuzzy order acceptance and scheduling problem","authors":"E. Karakaş, Hakan Özpalamutçu","doi":"10.11121/IJOCTA.01.2019.00711","DOIUrl":null,"url":null,"abstract":"In light of the imprecise and fuzzy nature of real production environments, the order acceptance and scheduling (OAS) problem is associated with fuzzy processing times, fuzzy sequence dependent set up time and fuzzy due dates. In this study, a genetic algorithm (GA) which uses fuzzy ranking methods is proposed to solve the fuzzy OAS problem. The proposed algorithm is illustrated and analyzed using examples with different order sizes. As illustrative numerical examples, fuzzy OAS problems with 10, 15, 20, 25, 30 and 100 orders are considered. The feasibility and effectiveness of the proposed method are demonstrated. Due to the NP-hard nature of the problem, the developed GA has great importance to obtain a solution even for big scale fuzzy OAS problem. Also, the proposed GA can be utilized easily by all practitioners via the developed user interface.","PeriodicalId":37369,"journal":{"name":"International Journal of Optimization and Control: Theories and Applications","volume":"1 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2019-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Optimization and Control: Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11121/IJOCTA.01.2019.00711","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 2
Abstract
In light of the imprecise and fuzzy nature of real production environments, the order acceptance and scheduling (OAS) problem is associated with fuzzy processing times, fuzzy sequence dependent set up time and fuzzy due dates. In this study, a genetic algorithm (GA) which uses fuzzy ranking methods is proposed to solve the fuzzy OAS problem. The proposed algorithm is illustrated and analyzed using examples with different order sizes. As illustrative numerical examples, fuzzy OAS problems with 10, 15, 20, 25, 30 and 100 orders are considered. The feasibility and effectiveness of the proposed method are demonstrated. Due to the NP-hard nature of the problem, the developed GA has great importance to obtain a solution even for big scale fuzzy OAS problem. Also, the proposed GA can be utilized easily by all practitioners via the developed user interface.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
