Back to Search
Start Over
A Note on Single Machine Sequencing with Random Processing Times.
- Source :
- DTIC AND NTIS
- Publication Year :
- 1976
-
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)
Details
- Database :
- OAIster
- Journal :
- DTIC AND NTIS
- Notes :
- text/html, English
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.ocn831740300
- Document Type :
- Electronic Resource