摘要
提出一类有准备时间的排序问题;分析了LS算法解此问题的最坏情况;修改了LPT算法,使最差性能指标由4-2m改进到83-23m.
One kind of scheduling problem with setup time is proposed, the worst_case performance of LS is studied, LPT algorithm is improved and the worst_case performance ratio 4-2 m is reduced to 83-23 m .
出处
《曲阜师范大学学报(自然科学版)》
CAS
1997年第1期9-12,共4页
Journal of Qufu Normal University(Natural Science)
基金
国家自然科学基金