SOME HEURISTICS FOR SCHEDULING JOBS ON PARALLEL MACHINES WITH SETUPS

被引:43
|
作者
SO, KC
机构
[1] Univ of California, Irvine, CA
关键词
D O I
10.1287/mnsc.36.4.467
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:467 / 475
页数:9
相关论文
共 50 条