The SCEAS System
Navigation Menu

Journals in DBLP

Oper. Res. Lett.
1997, volume: 21, number: 4

  1. Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir
    Structured p-facility location problems on the line solvable in polynomial time. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:4, pp:159-164 [Journal]
  2. Bo Chen, Arjen P. A. Vestjens
    Scheduling on identical machines: How good is LPT in an on-line setting? [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:4, pp:165-169 [Journal]
  3. Vladimir Kats, Eugene Levner
    A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:4, pp:171-179 [Journal]
  4. P. Wu, Morton J. M. Posner
    A level-crossing approach to the solution of the shortest-queue problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:4, pp:181-189 [Journal]
  5. Koichi Nakade, Katsuhisa Ohno, J. George Shanthikumar
    Bounds and approximations for cycle times of a U-shaped production line. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:4, pp:191-200 [Journal]
  6. Nico M. van Dijk, Masakiyo Miyazawa
    Error bounds on a practical approximation for finite tandem queues. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:4, pp:201-208 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002