A Note on Single Machine Sequencing with Random Processing Times.
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
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
- Theoretical Mathematics