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