有时间限制的并行机器上的批调度问题及算法

2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics Pub Date : 2015-08-26 DOI:10.1109/IHMSC.2015.108

Haixia Li, Xiaoli Gao, Chuanguang Sun

{"title":"有时间限制的并行机器上的批调度问题及算法","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":"{\"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}","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

摘要

考虑有时间约束的m台并行机器上的批量调度问题，以最小化总加权完成时间。每台批处理机可以同时处理10个批处理作业。提出了一种相同作业加工时间模型的多项式时间最优算法，给出了该算法的细节和证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Batch Scheduling Problem and Algorithm on Parallel Machines with Time Bound

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics

自引率

0.00%

发文量