摘要
在实际制造环境中,机器由于随机故障或进行预防性维护等,在某些时间段内处于不可用状态,为此,该文研究了任意一台机器具有不可用时间间隔的两机流水车间调度问题,给出了使用Johnson算法得到问题最优解的条件,分析了将Johnson算法作为问题启发式算法的最坏性能比范围。该文研究结果为探索机器具有不可用时间间隔的两机流水车间调度问题的最优算法提供了理论依据。
In view of that a machine is unavailable due to breakdowns or preventive maintenances in the practical manufacturing environment, the two-machine flow shop scheduling problem with an una- vailable interval on any machine is studied. The optimality condition of solving the problem by the Johnson algorithm is presented. The worst-case performance ratio of the Johnson algorithm as a heuristic is analyzed. The results provide the theoretical bases for exploring the optimal algorithm of the two-machine flow shop scheduling problem with an unavailable interval.
出处
《南京理工大学学报》
EI
CAS
CSCD
北大核心
2015年第2期202-205,214,共5页
Journal of Nanjing University of Science and Technology
基金
国家自然科学基金(70901021)
教育部新世纪优秀人才支持计划(NCET-11-0903)
