【摘要】 研究了目标函数是最小最大完成时间的同类机调度问题,其中作业到达时间可能不同。此问题被证明是NP-hard问题。通过对单机和同型机的相应问题研究成果的推广,提出5个启发式算法,给出算例及其计算结果,并通过实验对算法的性能及算法适应的情形进行了分析,与现有Koulamas&Kyparisis的算法进行了比较。更多还原

【Abstract】 The problem of uniform parallel machine scheduling with unequal release dates was considered so as to minimize makespan.Five heuristic algorithms were proposed by the way of extending the research results of the corresponding problems in the single machine or identical parallel machine cases.An example and the compute results were given and the performance of the algorithms by experiment was analyzed.Comparison was made between the heuristics and existing Koulamas&Kyparisis’s algorithm.更多还原