Haixia Li, Youzeng Wang, Qingfeng Liu, Sun Chuanguang
{"title":"利用学习效应批量调度工作,使总加权完成时间最小化","authors":"Haixia Li, Youzeng Wang, Qingfeng Liu, Sun Chuanguang","doi":"10.1109/ICNC.2011.6022318","DOIUrl":null,"url":null,"abstract":"In this paper, we study the problems with learning effect to minimize the total weighted completion time on a single or parallel batch machines. We provide some optimal algorithms for three special cases, where all the jobs have the same processing time.","PeriodicalId":299503,"journal":{"name":"2011 Seventh International Conference on Natural Computation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Batch scheduling jobs with learning effect to minimize the total weighted completion time\",\"authors\":\"Haixia Li, Youzeng Wang, Qingfeng Liu, Sun Chuanguang\",\"doi\":\"10.1109/ICNC.2011.6022318\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the problems with learning effect to minimize the total weighted completion time on a single or parallel batch machines. We provide some optimal algorithms for three special cases, where all the jobs have the same processing time.\",\"PeriodicalId\":299503,\"journal\":{\"name\":\"2011 Seventh International Conference on Natural Computation\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Seventh International Conference on Natural Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2011.6022318\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Seventh International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2011.6022318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Batch scheduling jobs with learning effect to minimize the total weighted completion time
In this paper, we study the problems with learning effect to minimize the total weighted completion time on a single or parallel batch machines. We provide some optimal algorithms for three special cases, where all the jobs have the same processing time.