Accession Number:

ADA026574

Title:

A Note on Single Machine Sequencing with Random Processing Times.

Descriptive Note:

Research rept.,

Corporate Author:

FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING

Personal Author(s):

Report Date:

1976-06-01

Pagination or Media Count:

9.0

Abstract:

It is shown that Lawlers 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

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE