{"title":"作业车间调度的混合蛙跃算法","authors":"Yuexia Zhang, Jiacheng Jin, S. Yin","doi":"10.1109/ICIEA.2019.8834138","DOIUrl":null,"url":null,"abstract":"An improved frog-leap algorithm for job-shop scheduling is proposed. The algorithm forms frog individuals via process-based coding and utilizes the switched local search strategy to make frog individuals quickly find the minimum fitness function, thereby improving scheduling efficiency of the job shop. The proposed algorithm offers advantages, such as few parameters, simple implementation, strong global optimization ability, and dynamic balance between local and global searches. It offers means to effectively solve problems associated with job-shop scheduling.","PeriodicalId":311302,"journal":{"name":"2019 14th IEEE Conference on Industrial Electronics and Applications (ICIEA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Hybrid frog-leap algorithm for job shop scheduling\",\"authors\":\"Yuexia Zhang, Jiacheng Jin, S. Yin\",\"doi\":\"10.1109/ICIEA.2019.8834138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An improved frog-leap algorithm for job-shop scheduling is proposed. The algorithm forms frog individuals via process-based coding and utilizes the switched local search strategy to make frog individuals quickly find the minimum fitness function, thereby improving scheduling efficiency of the job shop. The proposed algorithm offers advantages, such as few parameters, simple implementation, strong global optimization ability, and dynamic balance between local and global searches. It offers means to effectively solve problems associated with job-shop scheduling.\",\"PeriodicalId\":311302,\"journal\":{\"name\":\"2019 14th IEEE Conference on Industrial Electronics and Applications (ICIEA)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 14th IEEE Conference on Industrial Electronics and Applications (ICIEA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIEA.2019.8834138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 14th IEEE Conference on Industrial Electronics and Applications (ICIEA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEA.2019.8834138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hybrid frog-leap algorithm for job shop scheduling
An improved frog-leap algorithm for job-shop scheduling is proposed. The algorithm forms frog individuals via process-based coding and utilizes the switched local search strategy to make frog individuals quickly find the minimum fitness function, thereby improving scheduling efficiency of the job shop. The proposed algorithm offers advantages, such as few parameters, simple implementation, strong global optimization ability, and dynamic balance between local and global searches. It offers means to effectively solve problems associated with job-shop scheduling.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
