摘要
用线性规划的优先策略寻求两类NP难的随机排序问题的近似解法,并分别给出了其近似度.
In order to solve two classes of NP-hard stochastic scheduling problems,an approximation algorithm based on the priority strategy of linear programming(LP)is studied,and their approximate degrees are given respectively.
作者
王艳红
雷松泽
张文娟
李蕊
Wang Yanhong;Lei Songze;Zhang Wenjuan;Li Rui(College of science,Xi an Technological University,Xi'an 710032,Shanxi,China;School of Computer Science & Engineering,Xi'an 710032,Shanxi,China)
出处
《江苏师范大学学报(自然科学版)》
CAS
2019年第1期60-62,共3页
Journal of Jiangsu Normal University:Natural Science Edition
基金
陕西省教育厅专项科研计划项目(17JK0364)
西安工业大学校长基金项目(XAGDXJJ17027)
关键词
随机排序
线性规划
优先策略
NP难
stochastic schedule
linear programming
priority policy
NP-hard