Scheduling Jobs on Two Facilities to Minimize Makespan

R. L. Bulfin and R. G. Parker
Additional contact information
R. L. Bulfin: University of Arizona
R. G. Parker: Georgia Institute of Technology

Management Science, 1980, vol. 26, issue 2, 202-214

Abstract: This paper is concerned with the problem of scheduling tasks on a system consisting of two parallel processors in order that makespan be minimized. In particular, we treat a variety of modifications to this basic theme, including the cases of identical, proportional, and unrelated processors. In addition, a heuristic scheme is suggested when precedence constraints exist where such constraints may be assignment dependent. Substantial computational experience is reported in all cases where it would appear that relatively large problems can be handled routinely.

Keywords: production/scheduling: flow shop; programming: integer; applications (search for similar items in EconPapers)
Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.26.2.202 (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:26:y:1980:i:2:p:202-214

Access Statistics for this article

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