{"title":"Scheduling on the parallel machines with mould constraint","authors":"Chen Xianzhang, Wang Chengyao","doi":"10.1109/SICE.1999.788717","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of scheduling n grouped jobs on m identical parallel machines with objective of minimizing the sum tardiness, subject to the constraints that each model number is only one and has different matching with each machine. A heuristic approach based on list scheduling is presented. Some conditions are presented which can break the sequence of assigning jobs. The results show that it can get a satisfactory solution.","PeriodicalId":103164,"journal":{"name":"SICE '99. Proceedings of the 38th SICE Annual Conference. International Session Papers (IEEE Cat. No.99TH8456)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SICE '99. Proceedings of the 38th SICE Annual Conference. International Session Papers (IEEE Cat. No.99TH8456)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SICE.1999.788717","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
This paper addresses the problem of scheduling n grouped jobs on m identical parallel machines with objective of minimizing the sum tardiness, subject to the constraints that each model number is only one and has different matching with each machine. A heuristic approach based on list scheduling is presented. Some conditions are presented which can break the sequence of assigning jobs. The results show that it can get a satisfactory solution.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
