An Analysis of the Two-Machine Static, Stochastic Flowshop With Linear Completion Time Costs

This study investigated the n-job, two-machine, static flowshop with independent, exponential job processing times and linear completion time or penalty costs. The objective was to find a job sequence which minimizes the expected total penalty cost for all the jobs. This performance measure is more complicated and more complete than that used in all the previous analytical, stochastic, multi-machine, flowshop studies; namely, the expected schedule length. The expected total penalty cost for all the jobs is a function of both the penalty cost associated with each job and the expected job completion time.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Business Administration

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2014

Author dc:creator

• Forst, Frank Gregory

• Business Administration, General

Language dc:language

eng

Identifier

(UMI)AAI8114423

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/67325