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.
[1] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[2] Stephen C. Graves,et al. A Review of Production Scheduling , 1981, Oper. Res..
[3] Edward G. Coffman,et al. An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..