Result 1 to 20 of 169 total
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times. (English)
Discrete Optim. 9, No. 4, 241-248 (2012).
1
On the competitiveness of AIMD-TCP within a general network. (English)
Theor. Comput. Sci. 462, 12-22 (2012).
2
Online algorithms for the multiple time series search problem. (English)
Comput. Oper. Res. 39, No. 5, 929-938 (2012).
3
Online scheduling of two job types on a set of multipurpose machines with unit processing times. (English)
Comput. Oper. Res. 39, No. 2, 405-412 (2012).
4
Algorithms better than LPT for semi-online scheduling with decreasing processing times. (English)
Oper. Res. Lett. 40, No. 5, 349-352 (2012).
5
Online scheduling with one rearrangement at the end: revisited. (English)
Inf. Process. Lett. 112, No. 16, 641-645 (2012).
6
A semi-on-line scheduling problem of two parallel machines with common maintenance time. (English)
Asia-Pac. J. Oper. Res. 29, No. 4, 1250020,13p. (2012).
7
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints. (English)
Theor. Comput. Sci. 457, 174-180 (2012).
8
Online maximum $k$-coverage. (English)
Discrete Appl. Math. 160, No. 13-14, 1901-1913 (2012).
9
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. (English)
Discrete Appl. Math. 160, No. 7-8, 1191-1210 (2012).
10
Optimal algorithms for online time series search and one-way trading with interrelated prices. (English)
J. Comb. Optim. 23, No. 2, 159-166 (2012).
11
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead. (English)
Inf. Process. Lett. 112, No. 7, 292-297 (2012).
12
Online scheduling on three uniform machines. (English)
Discrete Appl. Math. 160, No. 3, 291-302 (2012).
13
Bounds for nonadaptive group tests to estimate the amount of defectives. (English)
Discrete Math. Algorithms Appl. 3, No. 4, 517-536 (2011).
14
Two-machine flow shop problems with availability constraints. (Chinese)
Oper. Res. Trans. 15, No. 3, 62-69 (2011).
15
An online batch scheduling with linear deterioration effect. (Chinese)
Oper. Res. Trans. 15, No. 3, 107-114 (2011).
16
Optimal semi-online algorithm for scheduling with rejection on two uniform machines. (English)
J. Comb. Optim. 22, No. 4, 674-683 (2011).
17
On-line machine covering on two machines with local migration. (English)
Comput. Math. Appl. 62, No. 5, 2336-2341 (2011).
18
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. (English)
J. Sched. 14, No. 4, 361-369 (2011).
19
Online rectangle filling. (English)
Theor. Comput. Sci. 412, No. 39, 5247-5275 (2011).
20
Result 1 to 20 of 169 total
Start
Contact
Print
General Help
