{"title":"鲁棒循环作业车间问题的分支定界方法","authors":"Idir Hamaz, L. Houssin, S. Cafieri","doi":"10.1007/978-3-319-96151-4_20","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem\",\"authors\":\"Idir Hamaz, L. Houssin, S. Cafieri\",\"doi\":\"10.1007/978-3-319-96151-4_20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":307867,\"journal\":{\"name\":\"International Symposium on Combinatorial Optimization\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Combinatorial Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-96151-4_20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Combinatorial Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-96151-4_20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}