A probabilistic analysis of two-machine flowshops

Amar Ramudhin; John J. Bartholdi; James M. Calvin; John H. Vande Vate; Gideon Weiss

doi:10.1287/opre.44.6.899

A probabilistic analysis of two-machine flowshops

Amar Ramudhin, John J. Bartholdi, James M. Calvin, John H. Vande Vate, Gideon Weiss

Research output: Contribution to journal › Article › peer-review

Abstract

We study a two-machine flowshop in which all processing times are independently and identically distributed, with values known to the scheduler. We are able to describe in detail the expected behavior of the flowshop under optimal and heuristic schedules. Our results suggest that minimizing makespan might be a superfluous objective: random schedules are easier to construct and require significantly less intermediate storage between the machines; moreover, they are known to be asymptotically optimal.

Original language	English
Pages (from-to)	899-908
Number of pages	10
Journal	Operations Research
Volume	44
Issue number	6
DOIs	https://doi.org/10.1287/opre.44.6.899
State	Published - 1996
Externally published	Yes

ASJC Scopus subject areas

Computer Science Applications
Management Science and Operations Research

Access to Document

10.1287/opre.44.6.899

Cite this

@article{bd02861ddcca4915bd7a3e8495421025,

title = "A probabilistic analysis of two-machine flowshops",

abstract = "We study a two-machine flowshop in which all processing times are independently and identically distributed, with values known to the scheduler. We are able to describe in detail the expected behavior of the flowshop under optimal and heuristic schedules. Our results suggest that minimizing makespan might be a superfluous objective: random schedules are easier to construct and require significantly less intermediate storage between the machines; moreover, they are known to be asymptotically optimal.",

author = "Amar Ramudhin and Bartholdi, {John J.} and Calvin, {James M.} and {Vande Vate}, {John H.} and Gideon Weiss",

year = "1996",

doi = "10.1287/opre.44.6.899",

language = "English",

volume = "44",

pages = "899--908",

journal = "Operations Research",

issn = "0030-364X",

publisher = "INFORMS Institute for Operations Research and the Management Sciences",

number = "6",

}

TY - JOUR

T1 - A probabilistic analysis of two-machine flowshops

AU - Ramudhin, Amar

AU - Bartholdi, John J.

AU - Calvin, James M.

AU - Vande Vate, John H.

AU - Weiss, Gideon

PY - 1996

Y1 - 1996

N2 - We study a two-machine flowshop in which all processing times are independently and identically distributed, with values known to the scheduler. We are able to describe in detail the expected behavior of the flowshop under optimal and heuristic schedules. Our results suggest that minimizing makespan might be a superfluous objective: random schedules are easier to construct and require significantly less intermediate storage between the machines; moreover, they are known to be asymptotically optimal.

AB - We study a two-machine flowshop in which all processing times are independently and identically distributed, with values known to the scheduler. We are able to describe in detail the expected behavior of the flowshop under optimal and heuristic schedules. Our results suggest that minimizing makespan might be a superfluous objective: random schedules are easier to construct and require significantly less intermediate storage between the machines; moreover, they are known to be asymptotically optimal.

UR - http://www.scopus.com/inward/record.url?scp=0030281871&partnerID=8YFLogxK

U2 - 10.1287/opre.44.6.899

DO - 10.1287/opre.44.6.899

M3 - Article

AN - SCOPUS:0030281871

SN - 0030-364X

VL - 44

SP - 899

EP - 908

JO - Operations Research

JF - Operations Research

IS - 6

ER -

A probabilistic analysis of two-machine flowshops

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this