| 具有CON/SLK交货期指派的一类单机排序问题 |
| |
| 引用本文： | 余英,程明宝,镇璐.具有CON/SLK交货期指派的一类单机排序问题[J].数学的实践与认识,2017(3):17-24. |
| |
| 作者姓名： | 余英 程明宝 镇璐 |
| |
| 作者单位： | 1. 凯里学院数学科学学院,贵州凯里,556011;2. 广东工业大学管理学院,广东广州,510643;3. 上海大学管理学院,上海,200444 |
| |
| 基金项目： | 贵州省科技厅、黔东南州科技局、凯里学院科技联合基金:基于共同交货期的提前延误排序问题(黔科合LH字[2014]7232)，贵州省凯里学院院级自然科学科研课题(重点课题):考虑资源有限性的资源配置与调度优化研究(Z1602)，国家留学基金，国家自然科学考虑患者意愿的关键医疗资源配置与调度优化研究(71571050) |
| |
| 摘 要： | 研究工件的实际加工时间既具有指数学习效应,又依赖所消耗资源的准时制排序问题.在模型中,探讨了共同交货期(CON)和松弛交货期(SLK)两种情形.管理者的目标是确定最优序、最优资源分配方案和最佳工期(共同交货期或松弛交货期)以便极小化工件的总延误、总提前、总工期和资源消耗费用的总和.对于工件的实际加工时间是资源消耗量的线性函数的排序问题,通过将其转化为指派模型,给出了时间复杂性为O(n~3)的算法,从而证明该类排序问题是多项式时间可求解的.针对工件的实际加工时间是资源消耗量的凸函数的排序问题,也给出了多项式算法.
|
| 关 键 词： | 单机排序 CON/SLK工期指派 指派问题 学习效应 资源依赖 |
Scheduling Problems with CON/SLK Due Date Assignment |
| |
| YU Ying,CHENG Ming-bao,ZHEN Lu.Scheduling Problems with CON/SLK Due Date Assignment[J].Mathematics in Practice and Theory,2017(3):17-24. |
| |
| Authors: | YU Ying CHENG Ming-bao ZHEN Lu |
| |
| Abstract: | This paper discusses single machine JIT scheduling problems in which the actual processing time is exponential learning effect and resource-dependent.In the model,we study common due date (CON) and slack due date(SLK) cases respectively.Managers's aim is to decide the optimal sequence,the optimal resource allocation and the optimal due date(CON or SLK) to minimize the sum of the total tardiness,the total earliness,the total due date and the total resource cost.For the actual processing time of each job is linear resource-dependent,we give algorithms of O(n3) time by converting them to assignment problems,thus we prove that these scheduling problems are polynomial time solvable.For the actual processing time of each job is convex resource-dependent,we present polynomial time solvable algorithms for each problem. |
| |
| Keywords: | single machine scheduling CON/SLK due date assignment assignment problem learning effect resource-dependent |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
