The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jerzy Kamburowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann
    Minimizing the complexity of an activity network. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:1, pp:47-52 [Journal]
  2. Pawel Jan Kalczynski, Jerzy Kamburowski
    Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:6, pp:529-536 [Journal]
  3. Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann
    Optimal Reductions of Two-Terminal Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:6, pp:1112-1129 [Journal]
  4. Pawel Jan Kalczynski, Jerzy Kamburowski
    On no-wait and no-idle flow shops with makespan criterion. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:178, n:3, pp:677-685 [Journal]
  5. Pawel Jan Kalczynski, Jerzy Kamburowski
    A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:169, n:3, pp:742-750 [Journal]

  6. An improved NEH heuristic to minimize makespan in permutation flow shops. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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