{"title":"具有简单作业交叉结构和有界作业分配的不相关并联机器的最大作业时间最小化","authors":"Daniel R. Page, Roberto Solis-Oba, M. Maack","doi":"10.1007/978-3-030-04651-4_23","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments\",\"authors\":\"Daniel R. Page, Roberto Solis-Oba, M. Maack\",\"doi\":\"10.1007/978-3-030-04651-4_23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":149649,\"journal\":{\"name\":\"International Conference on Combinatorial Optimization and Applications\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Combinatorial Optimization and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-04651-4_23\",\"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 Conference on Combinatorial Optimization and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-04651-4_23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}