Journals in DBLP

Computers & OR
2002, volume: 29, number: 10

1. William G. Ferrell Jr., Aman Chhoker
   Design of economically optimal acceptance sampling plans with inspection error. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:10, pp:1283-1300 [Journal]
   
2. Suk-Hun Yoon, Jose A. Ventura
   Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:10, pp:1301-1315 [Journal]
   
3. Kenneth E. Rosing, M. John Hodgson
   Heuristic concentration for the p-median: an example demonstrating how and why it works. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:10, pp:1317-1330 [Journal]
   
4. Umesh Chandra Gupta, V. Goswami
   Performance analysis of finite buffer discrete-time queue with bulk service. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:10, pp:1331-1341 [Journal]
   
5. Giuseppe Paletta
   The period traveling salesman problem: a new heuristic algorithm. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:10, pp:1343-1352 [Journal]
   
6. Marcos Escobar, Amedeo R. Odoni, Emily Roth
   Approximate solution for multi-server queueing systems with Erlangian service times. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:10, pp:1353-1374 [Journal]
   
7. Anito Joseph
   A concurrent processing framework for the set partitioning problem. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:10, pp:1375-1391 [Journal]
   
8. Tai-Hsi Wu, Chinyao Low, Jiunn-Wei Bai
   Heuristic solutions to multi-depot location-routing problems. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:10, pp:1393-1415 [Journal]
   
9. Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov
   Heuristics for hybrid flow shops with controllable processing times and assignable due dates. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2002, v:29, n:10, pp:1417-1439 [Journal]
   
10. Edward Yu-Hsien Lin, Dennis L. Bricker
    Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:10, pp:1441-1446 [Journal]