 | 2012 |
|---|
| 10 |       | Pawel Jan Kalczynski,
Jerzy Kamburowski:
An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times.
Computers & OR 39(11): 2659-2665 (2012) |
| 2009 |
|---|
| 9 | | Pawel Jan Kalczynski,
Jerzy Kamburowski:
An empirical analysis of the optimality rate of flow shop heuristics.
European Journal of Operational Research 198(1): 93-101 (2009) |
| 2008 |
|---|
| 8 | | Pawel Jan Kalczynski,
Jerzy Kamburowski:
An improved NEH heuristic to minimize makespan in permutation flow shops.
Computers & OR 35(9): 3001-3008 (2008) |
| 2007 |
|---|
| 7 | | 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 |
|---|
| 6 | | 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 |
|---|
| 5 | | 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 |
|---|
| 4 | | Jerzy Kamburowski:
On three-machine flow shops with random job processing times.
European Journal of Operational Research 125(2): 440-448 (2000) |
| 3 | | Jerzy Kamburowski,
David J. Michael,
Matthias F. M. Stallmann:
Minimizing the complexity of an activity network.
Networks 36(1): 47-52 (2000) |
| 1999 |
|---|
| 2 | | Jerzy Kamburowski:
Stochastically minimizing the makespan in two-machine flow shops without blocking.
European Journal of Operational Research 112(2): 304-309 (1999) |
| 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page