Journals in DBLP

Computers & OR
1999, volume: 26, number: 8

1. T. C. Edwin Cheng, Qing Ding
   The time dependent machine makespan problem is strongly NP-complete. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:8, pp:749-754 [Journal]
   
2. Soung Hie Kim, Chang Hee Han
   An interactive procedure for multi-attribute group decision making with incomplete information. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:8, pp:755-772 [Journal]
   
3. Funda Sivrikaya-Serifoglu, Gündüz Ulusoy
   Parallel machine scheduling with earliness and tardiness penalties. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:8, pp:773-787 [Journal]
   
4. João Manuel Coutinho-Rodrigues, João C. N. Clímaco, John R. Current
   An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:8, pp:789-798 [Journal]
   
5. Shouhong Wang
   Nonlinear regression: a hybrid model. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:8, pp:799-817 [Journal]
   
6. Wen Lea Pearn, J. B. Chou
   Improved solutions for the Chinese postman problem on mixed networks. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:8, pp:819-827 [Journal]
   
7. Alf Kimms
   A genetic algorithm for multi-level, multi-machine lot sizing and scheduling. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:8, pp:829-848 [Journal]