Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
Management Science · 1990 · Volume 36 · Issue 4
Abstract
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.
Keywords
production scheduling: group technology, dynamic programming: applications, heuristics
Enable JavaScript for citation tools and additional paper interactions.