Some Heuristics for Scheduling Jobs on Parallel Machines with Setups

Kut C. So
Additional contact information
Kut C. So: Graduate School of Management, University of California, Irvine, California 92717

Management Science, 1990, vol. 36, issue 4, 467-475

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 (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.36.4.467 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:36:y:1990:i:4:p:467-475

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().