Parallel Sequencing and Assembly Line Problems

T. C. Hu
Additional contact information
T. C. Hu: IBM Research Center, Yorktown, New York

Operations Research, 1961, vol. 9, issue 6, 841-848

Abstract: This paper deals with a new sequencing problem in which n jobs with ordering restrictions have to be done by men of equal ability. Assume every man can do any of the n jobs. The two questions considered in this paper are (1) How to arrange a schedule that requires the minimum number of men so that all jobs are completed within a prescribed time T , and (2) if m men are available, arrange a schedule that completes all jobs at the earliest time.

Date: 1961
References: Add references at CitEc
Citations: View citations in EconPapers (29)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.9.6.841 (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:oropre:v:9:y:1961:i:6:p:841-848

Access Statistics for this article

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