A Sequencing Problem with Release Dates and Clustered Jobs
研究单机调度问题，目标是最小化加权完成时间之和，并考虑释放时间约束。针对作业聚类的情况，提出了多项式时间算法，并基于此设计了无聚类情况下的高效启发式算法。
This paper considers a one-machine scheduling problem where the objective is to minimize the sum of weighted completion times subject to release dates. A polynomial time algorithm is developed for the case when the jobs are clustered. The jobs in each cluster must be processed sequentially and the clusters are ordered. The insights developed are used in an efficient heuristic for the weighted completion time problem without clusters. Also, a class of release date problems is described for which the heuristic finds an optimal solution.