具有固定操作符或机器不可用区间的单机最大时延最小化的改进全多项式逼近格式

{"title":"具有固定操作符或机器不可用区间的单机最大时延最小化的改进全多项式逼近格式","authors":"I. Kacem, H. Kellerer","doi":"10.1007/978-3-030-00898-7_28","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":339476,"journal":{"name":"International Conference on Computational Logistics","volume":"8 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval\",\"authors\":\"I. Kacem, H. Kellerer\",\"doi\":\"10.1007/978-3-030-00898-7_28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":339476,\"journal\":{\"name\":\"International Conference on Computational Logistics\",\"volume\":\"8 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computational Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-00898-7_28\",\"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 Computational Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-00898-7_28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}