A Heuristic Procedure for Parallel Sequencing with Choice of Machines

Eugene S. Schwartz
Additional contact information
Eugene S. Schwartz: IIT Research Institute, Chicago

Management Science, 1964, vol. 10, issue 4, 767-777

Abstract: An algorithm is described for parallel sequencing on two machines of a set of operations with partial ordering constraints. Some assignments are fixed and some are flexible allowing a choice of machines; operation times for the flexible assignments are assumed to be equal. The algorithm establishes a parallel sequence that seeks to minimize the elapsed time required for both machines to complete processing without testing the set of possible permutations on operations. Assignment decision rules are formulated to balance the parallel sequences considering accumulated time and remaining future commitments on each machine. Experimental results comparing programmed solutions with lower bounds of running time are given.

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.10.4.767 (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:10:y:1964:i:4:p:767-777

Access Statistics for this article

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