M. Cruz-Chávez, J. Frausto-Solís, Jesús Roberto Cora-Mora
{"title":"邻域生成机制在调度问题中的实验分析","authors":"M. Cruz-Chávez, J. Frausto-Solís, Jesús Roberto Cora-Mora","doi":"10.1109/CERMA.2006.112","DOIUrl":null,"url":null,"abstract":"This paper presents a neighborhood generation mechanism for the job shop scheduling problems (JSSP). In order to obtain a feasible neighbor with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack-time between the adjacent pair of operations that is permuted, then it is proven, through experimentation that the new neighbor (schedule) generated is feasible","PeriodicalId":179210,"journal":{"name":"Electronics, Robotics and Automotive Mechanics Conference (CERMA'06)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Experimental Analysis of a Neighborhood Generation Mechanism Applied to Scheduling Problem\",\"authors\":\"M. Cruz-Chávez, J. Frausto-Solís, Jesús Roberto Cora-Mora\",\"doi\":\"10.1109/CERMA.2006.112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a neighborhood generation mechanism for the job shop scheduling problems (JSSP). In order to obtain a feasible neighbor with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack-time between the adjacent pair of operations that is permuted, then it is proven, through experimentation that the new neighbor (schedule) generated is feasible\",\"PeriodicalId\":179210,\"journal\":{\"name\":\"Electronics, Robotics and Automotive Mechanics Conference (CERMA'06)\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronics, Robotics and Automotive Mechanics Conference (CERMA'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CERMA.2006.112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronics, Robotics and Automotive Mechanics Conference (CERMA'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CERMA.2006.112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Experimental Analysis of a Neighborhood Generation Mechanism Applied to Scheduling Problem
This paper presents a neighborhood generation mechanism for the job shop scheduling problems (JSSP). In order to obtain a feasible neighbor with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack-time between the adjacent pair of operations that is permuted, then it is proven, through experimentation that the new neighbor (schedule) generated is feasible
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
