Johnson-type algorithms for m-machine flow shops

dc.contributor.author	Dehghan-Nayeri, Majid
dc.contributor.department	Statistics (LAS)
dc.date	2018-08-15T23:58:41.000
dc.date.accessioned	2020-07-02T05:58:47Z
dc.date.available	2020-07-02T05:58:47Z
dc.date.copyright	Thu Jan 01 00:00:00 UTC 1981
dc.date.issued	1981
dc.description.abstract	<p>The problem of scheduling a flow shop is discussed, and a general structure for paired-comparison based scheduling algorithms is identified;A special such algorithm for three machines is introduced, and the complete 3-machine adaptation of Johnson's algorithm, suggested by Burns and Rooker is extended to the case of an arbitrary number of machines.</p>
dc.format.mimetype	application/pdf
dc.identifier	archive/lib.dr.iastate.edu/rtd/7161/
dc.identifier.articleid	8160
dc.identifier.contextkey	6305000
dc.identifier.doi	https://doi.org/10.31274/rtd-180813-5376
dc.identifier.s3bucket	isulib-bepress-aws-west
dc.identifier.submissionpath	rtd/7161
dc.identifier.uri	https://dr.lib.iastate.edu/handle/20.500.12876/80008
dc.language.iso	en
dc.source.bitstream	archive/lib.dr.iastate.edu/rtd/7161/r_8122508.pdf\|\|\|Sat Jan 15 01:43:22 UTC 2022
dc.subject.disciplines	Industrial Engineering
dc.subject.keywords	Statistics
dc.subject.keywords	Engineering Valuation
dc.title	Johnson-type algorithms for m-machine flow shops
dc.type	dissertation
dc.type.genre	dissertation
dspace.entity.type	Publication
relation.isOrgUnitOfPublication	264904d9-9e66-4169-8e11-034e537ddbca
thesis.degree.level	dissertation
thesis.degree.name	Doctor of Philosophy

Now showing 1 - 1 of 1