A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This paper describes a simple algorithm for the solution of very large sequence problems without the use of a computer. It produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time. Up to m - 1 sequences may be found.

MoreLess

Year of publication:	1970
Authors:	Campbell, Herbert G. ; Dudek, Richard A. ; Smith, Milton L.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 16.1970, 10, p. 630-630
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

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

Persistent link: https://www.econbiz.de/10009190426