The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem

Authors:
Philip Kaminsky;David Simchi-Levi
Affiliations:
-;-
Venue:
Operations Research
Year:
2001

Citing 0
Cited 4

Worst case analysis of a new lower bound for flow shop weighted completion time problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Scheduling a two-stage flowshop under makespan constraint

Mathematical and Computer Modelling: An International Journal
Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates

Operations Research Letters
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the flow shop mean completion time problem, a set of jobs has to be processed onm-machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize the sum of the completion times of all jobs on the final machine. In this paper, we prove the asymptotic optimality of the Shortest Processing Time algorithm for any continuous, independent, and identically distributed job processing times.