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.
No takes yet. Share an insight, caveat, or question.
Kut C. So (1990) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: