Non-identical Parallel-machine Scheduling Research With Minimizing Total Weighted Completion Times: Models, Relaxations And Algorithms

摘要

We consider a class of non-identical parallel-machine scheduling problems in which the goal is to minimize total (or mean) weighted (or unweighted) completion time. Models and relaxations are collected and classified in this paper. Heuristics and optimizing techniques are surveyed for the problems. And a few of interesting areas for future research are also provided.