{"title":"Batch Scheduling Problem and Algorithm on Parallel Machines with Time Bound","authors":"Haixia Li, Xiaoli Gao, Chuanguang Sun","doi":"10.1109/IHMSC.2015.108","DOIUrl":null,"url":null,"abstract":"We consider the problem of batch scheduling jobs on m parallel machines with time bound to minimize total weighted completion times. Each batching machine can processing to b jobs simultaneously as a batch. A polynomial-time optimal algorithm for identical job processing time model is presented whose details and proof are given.","PeriodicalId":6592,"journal":{"name":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"191 1","pages":"8-10"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IHMSC.2015.108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We consider the problem of batch scheduling jobs on m parallel machines with time bound to minimize total weighted completion times. Each batching machine can processing to b jobs simultaneously as a batch. A polynomial-time optimal algorithm for identical job processing time model is presented whose details and proof are given.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
