| 单机分族分批排序的最小误工个数问题 |
| |
| 引用本文： | 曹国梅.单机分族分批排序的最小误工个数问题[J].四川理工学院学报(自然科学版),2008,21(5). |
| |
| 作者姓名： | 曹国梅 |
| |
| 作者单位： | 郑州旅游职业学院,郑州,450009 |
| |
| 摘 要： | 文章研究了同一族内,给出并证明了其最优排序的性质。对工件到达时间和工期相一致时的情形,得出了一个时间复杂性为O(mb(n/m)2m)的动态规划算法。
|
| 关 键 词： | 排序 平行批分族排序 误工工件个数 动态规划 |
Single-machine Parallel-batching Scheduling Problem with Family Jobs to Minimize Tardy Jobs |
| |
| CAO Guo-mei.Single-machine Parallel-batching Scheduling Problem with Family Jobs to Minimize Tardy Jobs[J].Journal of Sichuan University of Science & Engineering:Natural Science Editton,2008,21(5). |
| |
| Authors: | CAO Guo-mei |
| |
| Abstract: | When the processing times of the jobs in the same family are equal, the problem of minimizing number of tardy jobs on a single-machine paralle-batch machine with family jobs is studied. Some qualities of the optimal solution are given and proved. For the case that the release time and due date of one job is agreeable, a dynamic programming algorithm with the complexity of O(mb( nm )2m) is given. |
| |
| Keywords: | scheduling parallel batch scheduling with family-jobs number of tardy jobs dynamic programming |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
