Stochastic Shop Scheduling: A Survey,

Abstract

In this paper a survey is made of some of the recent results in stochastic shop scheduling. The models dealt with include: open shops; flow shops with infinite intermediate storage (permutation flow shops); flow shops with zero intermediate storage and blocking; and job shops. Two objective functions are considered: Minimization of the expected completion time of the last job, the so-called makespan and minimization of the sum of the expected completion times of all jobs, the so-called flow time. The decision-maker is not allowed to preempt. The shop models with two machines and exponentially distributed processing times usually turn out to have a very nice structure. Shop models with more than two machines are considerably harder. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1981
Accession Number
ADA108088

Entities

People

  • Linus Schrage
  • Michael Pinedo

Organizations

  • Georgia Tech

Tags

Communities of Interest

  • C4I
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Communication Channels
  • Computer Science
  • Engineering
  • Military Research
  • Normal Distribution
  • Operations Research
  • Probability
  • Probability Density Functions
  • Production Engineering
  • Production Management Methods
  • Random Variables
  • Scheduling (Production)
  • Sequences
  • Surveys
  • Systems Engineering

Readers

  • Operations Research