Found: 12
Select item for more details and to access through your institution.
Ideal preemptive schedules on two processors.
- Published in:
- Acta Informatica, 2003, v. 39, n. 8, p. 597, doi. 10.1007/s00236-003-0119-6
- By:
- Publication type:
- Article
PROCESSOR SHADOWING: MAXIMIZING EXPECTED THROUGHPUT IN FAULT-TOLERANT SYSTEMS.
- Published in:
- Mathematics of Operations Research, 1999, v. 24, n. 2, p. 362, doi. 10.1287/moor.24.2.362
- By:
- Publication type:
- Article
REDIALING POLICIES: OPTIMALITY AND SUCCESS PROBABILITIES.
- Published in:
- Probability in the Engineering & Informational Sciences, 1999, v. 13, n. 1, p. 37, doi. 10.1017/s0269964899131048
- By:
- Publication type:
- Article
STOCHASTIC MACHINE MINIMIZATION WITH CONSTANT SERVICE TIMES.
- Published in:
- Mathematics of Operations Research, 1993, v. 18, n. 2, p. 300, doi. 10.1287/moor.18.2.300
- By:
- Publication type:
- Article
SERVICE BY A QUEUE AND A CART.
- Published in:
- Management Science, 1992, v. 38, n. 6, p. 867, doi. 10.1287/mnsc.38.6.867
- By:
- Publication type:
- Article
ON THE OPTIMAL STOCHASTIC SCHEDULING OF OUT-FORESTS.
- Published in:
- Operations Research, 1992, v. 40, n. 1, p. 67, doi. 10.1287/opre.40.1.S67
- By:
- Publication type:
- Article
BATCH SIZING AND JOB SEQUENCING ON A SINGLE MACHINE.
- Published in:
- Annals of Operations Research, 1990, v. 26, n. 1-4, p. 135, doi. 10.1007/BF02248589
- By:
- Publication type:
- Article
SEQUENCING PROBLEMS IN TWO-SERVER SYSTEMS.
- Published in:
- Mathematics of Operations Research, 1985, v. 10, n. 4, p. 585, doi. 10.1287/moor.10.4.585
- By:
- Publication type:
- Article
On the Expected Relative Performance of List Scheduling.
- Published in:
- Operations Research, 1985, v. 33, n. 3, p. 548, doi. 10.1287/opre.33.3.548
- By:
- Publication type:
- Article
PERMUTING ELEMENTS WITHIN COLUMNS OF A MATRIX IN ORDER TO MINIMIZE MAXIMUM ROW SUM.
- Published in:
- Mathematics of Operations Research, 1984, v. 9, n. 3, p. 384, doi. 10.1287/moor.9.3.384
- By:
- Publication type:
- Article
A NOTE ON EXPECTED MAKESPANS FOR LARGEST-FIRST SEQUENCES OF INDEPENDENT TASKS ON TWO PROCESSORS.
- Published in:
- Mathematics of Operations Research, 1984, v. 9, n. 2, p. 260, doi. 10.1287/moor.9.2.260
- By:
- Publication type:
- Article
A Characterization of Waiting Time Performance Realizable by Single-Server Queues.
- Published in:
- Operations Research, 1980, v. 28, n. 3, p. 810, doi. 10.1287/opre.28.3.810
- By:
- Publication type:
- Article