Loading...
Please wait, while we are loading the content...
Similar Documents
Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
| Content Provider | Semantic Scholar |
|---|---|
| Author | Borst, Sem C. Bruno, John L. Coffman, Edward G. Phillips, Steven J. |
| Copyright Year | 1997 |
| Abstract | Simple optimal policies are known for the problem of scheduling jobs to minimize expected makespan on two parallel machines when the job running-time distribution has a monotone hazard rate. But no such policy appears to be known in general. We investigate the general problem by adopting two-point running-time distributions, the simplest discrete distributions not having monotone hazard rates. We derive a policy that gives an explicit, compact solution to this problem and prove its optimality. We also comment briefly on first-order extensions of the model, but each of these seems to be markedly more difficult to analyze. |
| Starting Page | 95 |
| Ending Page | 105 |
| Page Count | 11 |
| File Format | PDF HTM / HTML |
| DOI | 10.1017/S0269964800004708 |
| Volume Number | 11 |
| Alternate Webpage(s) | http://www.ee.columbia.edu/~egc/webpapers/Two-Atom.pdf |
| Alternate Webpage(s) | http://www.comet.columbia.edu/~egc/webpapers/Two-Atom.ps |
| Alternate Webpage(s) | https://doi.org/10.1017/S0269964800004708 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
