Stochastic flow shop scheduling

Simple item page
dc.contributor.authorSuresh, S.en
dc.contributor.committeecochairDisney, R.L.en
dc.contributor.committeecochairFoley, R.D.en
dc.contributor.committeememberBesieris, Ioannis M.en
dc.contributor.committeememberMittal, Yashaswini D.en
dc.contributor.committeememberSherali, Hanifen
dc.contributor.departmentIndustrial Engineering and Operations Researchen
dc.date.accessioned2017-01-30T21:24:34Zen
dc.date.available2017-01-30T21:24:34Zen
dc.date.issued1987en
dc.description.abstractIn this dissertation we present new results for minimizing the makespan in a flow shop with zero storage between machines. Makespan is the total length of time required to process a set of jobs. We consider m machines and n jobs with random processing times. Since there is no intermediate storage between machines, a job that has finished processing at one machine may have to stay on that machine until the next machine is free. Our goal is to select a schedule that will minimize the makespan. Our results require various stochastic orderings of the processing time distributions. Some orderings minimize the expected makespan, and some stronger results stochastically minimize the makespan. The optimum sequence of these latter cases not only minimizes the expected makespan but also maximizes the probability of completing a set of jobs by time t for any t. The last result is concerned with scheduling jobs on two identical parallel machines. The jobs are subjected to some intree precedence constraints. We resolve a conjecture that appeared in Pinedo and Weiss (1985) and give conditions under which the conjecture is true and give examples to prove that the conjecture is false in general.en
dc.description.degreePh. D.en
dc.format.extentvi, 88 leavesen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/10919/74776en
dc.language.isoen_USen
dc.publisherVirginia Polytechnic Institute and State Universityen
dc.relation.isformatofOCLC# 16837462en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V856 1987.S973en
dc.subject.lcshStochastic processesen
dc.subject.lcshProduction schedulingen
dc.titleStochastic flow shop schedulingen
dc.typeDissertationen
dc.type.dcmitypeTexten
thesis.degree.disciplineIndustrial Engineering and Operations Researchen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.leveldoctoralen
thesis.degree.namePh. D.en

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V856_1987.S973.pdf
Size:
3.38 MB
Format:
Adobe Portable Document Format
Download

Collections

Doctoral Dissertations