摘要
这篇文章研究了在一致性条件下,具有一般学习效应的一类超前有奖延误受罚的排序问题.由于1‖∑jn=1(αjTj-βjEj)是NP-困难的,这篇文章研究了该模型的3类多项式时间可解的特例,并给出了相应的算法.
In this paper, a tardiness penalty and earliness award scheduling problem with a gen- eral learning effect and the processing times and the weights are consistant is studied. Due to n 1‖∑^n _j=1(ajTj-βjEj) is NP- hard, three polynomial time solvable cases are studied, and the corresponding algorithm is given.
出处
《凯里学院学报》
2013年第3期14-16,共3页
Journal of Kaili University
基金
凯里学院科研基金资助项目(Z1215)
关键词
排序
单机
学习效应
超前
延误
scheduling problem
single machine
learning effect
earliness
tardiness