摘要
研究目标为带权总完工时间的串行工件同时加工排序问题,证明该问题在分批数固定时的NP困难性,并基于数学规划提出随机化算法。最后,对特殊分批进行了讨论。
This paper is concerned with the problem of serial batching and scheduling to minimize total completion time. It＇s proved that the problem is NP_C when the number of batches is fixed. For this problem, we propose a randomized algorithm based on mathematical programming. Finally special batching is also introduced.
出处
《常州工学院学报》
2010年第2期67-70,共4页
Journal of Changzhou Institute of Technology
基金
国家自然科学基金项目(20710015)
常州工学院资助项目(YN0908)
关键词
同时加工排序
NP困难性
随机算法
数学规划
serial batching
NP-hardness
randomized algorithm
mathematical programming
