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.

MoreLess

Year of publication:	1990
Authors:	So, Kut C.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 36.1990, 4, p. 467-475
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	production scheduling: group technology \| dynamic programming: applications \| heuristics

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.36.4.467 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10009191795