有模具约束的并联机床调度

SICE '99. Proceedings of the 38th SICE Annual Conference. International Session Papers (IEEE Cat. No.99TH8456) Pub Date : 1999-07-28 DOI:10.1109/SICE.1999.788717

Chen Xianzhang, Wang Chengyao

{"title":"有模具约束的并联机床调度","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":"{\"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}","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

摘要

本文研究了在每个型号只有一个且与每台机器有不同匹配的约束下，以最小化延迟总和为目标，在m台相同的并行机器上调度n个分组作业的问题。提出了一种基于列表调度的启发式算法。提出了一些可以打破分配作业顺序的条件。结果表明，该方法能得到满意的解。

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

查看原文本刊更多论文

Scheduling on the parallel machines with mould constraint

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.

求助全文

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

来源期刊

SICE '99. Proceedings of the 38th SICE Annual Conference. International Session Papers (IEEE Cat. No.99TH8456)

自引率

0.00%

发文量