The SCEAS System
Navigation Menu

Journals in DBLP

J. Scheduling
2005, volume: 8, number: 2

  1. K. Subramani
    An Analysis of Totally Clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:2, pp:113-133 [Journal]
  2. Paulo Bárcia, J. Orestes Cerdeira
    The k-Track Assignment Problem on Partial Orders. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:2, pp:135-143 [Journal]
  3. Eugeniusz Nowicki, Czeslaw Smutnicki
    An Advanced Tabu Search Algorithm for the Job Shop Problem. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:2, pp:145-159 [Journal]
  4. H. A. J. Crauwels, C. N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove
    Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:2, pp:161-177 [Journal]
  5. Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis
    Scheduling trees with large communication delays on two identical processors. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:2, pp:179-190 [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