Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
研究并行机器上不同作业类型切换需设置时间的调度问题，目标是最大化总收益，提出了三种启发式算法并给出分析和实验结果。
This paper studies the problem of scheduling jobs on parallel machines with setup times. When a machine switches from processing one type of job to another type, setup times are incurred. The problem is to find a feasible schedule for each machine which maximizes the total reward. We study three heuristics for solving this problem. Analytical and empirical results of the heuristics are given.