【摘要】 研究了单机作业下极大化顾客满意数的提前 /拖期调度问题 ,惩罚函数基于这样的思想 :只要任务达不到顾客的满意度 ,就导致惩罚。给出了最优调度的性质并提出了最优调度的多项式算法 ,计算机仿真实例说明了所提出的算法更多还原

【Abstract】 This paper deals with the schedule problem on a single machine to maximize the number of satisfied customers. The penalty function is based on the idea:the penalties will occur if a job is not satisfied by the customer.The optimal schedule property is provided,and an ploynomial algorithm is presented to find the optimal schedule,an example is shown to illustrate how the algorithm is used.更多还原