摘要
研究一个从实践中提出的电网检修排序(调度)问题,并证明了该问题的一般情形是NP-困难的,对其特殊情形给出了多项式时间的算法.
This paper studies a class of scheduling problems of electric networks inspected and repaired rosen in practice,and the scheduling problem is proved to be NPhard generally but it is a solvable problem of polynomial time in particular case.
出处
《系统工程学报》
CSCD
1998年第2期52-56,共5页
Journal of Systems Engineering
关键词
排序问题
电网
检修
计算复杂性
多项式算法
single machine,scheduling problem,electric network,complexity,polynomial algorithm