Cat群算法求解作业车间调度问题

2014 Third IEEE International Colloquium in Information Science and Technology (CIST) Pub Date : 2014-10-01 DOI:10.1109/CIST.2014.7016619

A. Bouzidi, M. E. Riffi

{"title":"Cat群算法求解作业车间调度问题","authors":"A. Bouzidi, M. E. Riffi","doi":"10.1109/CIST.2014.7016619","DOIUrl":null,"url":null,"abstract":"The Job shop scheduling problem is known as a combinatorial optimization problem that aims to find best sequence of operations with optimal execution time called makespan. Various algorithms are used to resolve it. This research paper aims to provide a new adaptation to solve the job shop scheduling problem. Discrete cat swarm optimization algorithm (CSO) consists of two modes, which are: the seeking mode when the cat is resting and the tracing mode when the cat is hunting. These two modes are combined by a mixture ratio. The result applied to some benchmark instances and proves thus the performance of this adaptation.","PeriodicalId":106483,"journal":{"name":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Cat swarm optimization to solve job shop scheduling problem\",\"authors\":\"A. Bouzidi, M. E. Riffi\",\"doi\":\"10.1109/CIST.2014.7016619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Job shop scheduling problem is known as a combinatorial optimization problem that aims to find best sequence of operations with optimal execution time called makespan. Various algorithms are used to resolve it. This research paper aims to provide a new adaptation to solve the job shop scheduling problem. Discrete cat swarm optimization algorithm (CSO) consists of two modes, which are: the seeking mode when the cat is resting and the tracing mode when the cat is hunting. These two modes are combined by a mixture ratio. The result applied to some benchmark instances and proves thus the performance of this adaptation.\",\"PeriodicalId\":106483,\"journal\":{\"name\":\"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIST.2014.7016619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Third IEEE International Colloquium in Information Science and Technology (CIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIST.2014.7016619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 27

摘要

作业车间调度问题被称为组合优化问题，其目的是找到具有最佳执行时间(称为makespan)的最佳操作序列。各种算法被用来解决它。本研究旨在提供一种新的方法来解决作业车间调度问题。离散猫群优化算法(CSO)包括两种模式，即猫休息时的搜索模式和猫狩猎时的跟踪模式。这两种模式通过混合比组合在一起。将结果应用于一些基准实例，从而证明了这种自适应的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Cat swarm optimization to solve job shop scheduling problem

The Job shop scheduling problem is known as a combinatorial optimization problem that aims to find best sequence of operations with optimal execution time called makespan. Various algorithms are used to resolve it. This research paper aims to provide a new adaptation to solve the job shop scheduling problem. Discrete cat swarm optimization algorithm (CSO) consists of two modes, which are: the seeking mode when the cat is resting and the tracing mode when the cat is hunting. These two modes are combined by a mixture ratio. The result applied to some benchmark instances and proves thus the performance of this adaptation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 Third IEEE International Colloquium in Information Science and Technology (CIST)

自引率

0.00%

发文量