Journals in DBLP

Oper. Res. Lett.
2000, volume: 26, number: 4

1. Michel X. Goemans, Joel Wein, David P. Williamson
   A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:26, n:4, pp:149-154 [Journal]
   
2. Henk C. Tijms, R. Veldman
   A fast algorithm for the transient reward distribution in continuous-time Markov chains. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:26, n:4, pp:155-158 [Journal]
   
3. Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum
   Linear-shaped partition problems. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:26, n:4, pp:159-163 [Journal]
   
4. Jeffrey B. Sidney, Chris N. Potts, Chelliah Sriskandarajah
   A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:26, n:4, pp:165-173 [Journal]
   
5. Christos Koulamas, George J. Kyparisis
   Scheduling on uniform parallel machines to minimize maximum lateness. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:26, n:4, pp:175-179 [Journal]
   
6. Vitaly A. Strusevich
   Group technology approach to the open shop scheduling problem with batch setup times. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:26, n:4, pp:181-192 [Journal]
   
7. M. I. Sviridenko
   Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:26, n:4, pp:193-197 [Journal]