Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
Authors:
Open Access
- 1 January 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 28 (1) , 100-113
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Scheduling with Random Service TimesManagement Science, 1966
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956