| 带有学习与恶化效应的机器受限的总完工时间问题 |
| |
| 引用本文： | 崔苗苗.带有学习与恶化效应的机器受限的总完工时间问题[J].电子测试,2017(2). |
| |
| 作者姓名： | 崔苗苗 |
| |
| 作者单位： | 抚顺市四方高级中学,辽宁抚顺,112122 |
| |
| 摘 要： | 本文研究一种带有学习和恶化效应,并且机器具有可用性限制的单机排序问题.在这种模型中,工件的加工时间与所排位置及开始加工时间有关,以及机器在加工过程中,由于发生故障或进行维护与保养等原因产生的可用性限制.本文讨论的目标函数为极小化总完工时间的单机问题,对于机器在任意时间段维修的情况,分别给出了动态规划算法,分析了算法复杂性.
|
| 关 键 词： | 排序 学习效应 恶化效应 机器可用性限制 算法复杂性 动态规划 |
Machine - constrained total completion time with learning and worsening effects |
| |
| Cui MiaoMiao.Machine - constrained total completion time with learning and worsening effects[J].Electronic Test,2017(2). |
| |
| Authors: | Cui MiaoMiao |
| |
| Abstract: | This paper investigates a single machine scheduling problem with learning and worsening effects and machine availability constraints. In this model, the machining time of the workpiece is related to the position and starting time of machining, as well as the usability limitations of the machine during processing due to failure or maintenance and maintenance. The objective function discussed in this paper is a single machine problem which minimizes the total completion time. For the maintenance of the machine at any time, the dynamic programming algorithm is given and the complexity of the algorithm is analyzed. |
| |
| Keywords: | ranking learning effect worsening effect machine availability limitation algorithm complexity dynamic programming |
| 本文献已被 万方数据 等数据库收录！ |
|
