
Journals in DBLP
 Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir
Structured pfacility location problems on the line solvable in polynomial time. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:4, pp:159164 [Journal]
 Bo Chen, Arjen P. A. Vestjens
Scheduling on identical machines: How good is LPT in an online setting? [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:4, pp:165169 [Journal]
 Vladimir Kats, Eugene Levner
A strongly polynomial algorithm for nowait cyclic robotic flowshop scheduling. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:4, pp:171179 [Journal]
 P. Wu, Morton J. M. Posner
A levelcrossing approach to the solution of the shortestqueue problem. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:4, pp:181189 [Journal]
 Koichi Nakade, Katsuhisa Ohno, J. George Shanthikumar
Bounds and approximations for cycle times of a Ushaped production line. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:4, pp:191200 [Journal]
 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:201208 [Journal]
