A Note on Single Machine Sequencing with Random Processing Times.

Abstract

It is shown that Lawler's Efficient (order N2) algorithm for the N job, one machine, scheduling problem, where the objective is to minimize the maximum deferral cost, subject to arbitrary precedence relationships, also applies when the processing times are random variables and the objective is to minimize the maximum expected deferral cost. Several special cases are explored. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1976
Accession Number
ADA026574

Entities

People

  • Thom J. Hodgson

Organizations

  • University of Florida

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Engineering
  • Mathematics
  • Probability
  • Random Variables
  • Scheduling (Production)

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Life Cycle Cost Analysis
  • Parallel and Distributed Computing.