{"title":"单位时间作业车间调度的双目标分支定界算法:混合图着色方法","authors":"A. Kouider, H. A. Haddadène","doi":"10.1016/J.COR.2021.105319","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"52 1","pages":"105319"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach\",\"authors\":\"A. Kouider, H. A. Haddadène\",\"doi\":\"10.1016/J.COR.2021.105319\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":10582,\"journal\":{\"name\":\"Comput. Oper. Res.\",\"volume\":\"52 1\",\"pages\":\"105319\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Comput. Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/J.COR.2021.105319\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Comput. Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/J.COR.2021.105319","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3