Jerzy Kamburowski

21 papers Journal 21
YearRankTypeTitle / Venue / Authors
2015 J jnl
Corrigendum to "The distribution-free newsboy problem under the worst-case and best-case scenarios" [Eur. J. Oper. Res. 237(2014) 106-112].
Eur. J. Oper. Res.
Jerzy Kamburowski
2015 J jnl
On the distribution-free newsboy problem with some non-skewed demands.
Oper. Res. Lett.
Jerzy Kamburowski
2015 J jnl
The distribution-free newsboy problem and the demand skew.
Int. Trans. Oper. Res.
Jerzy Kamburowski
2014 J jnl
The distribution-free newsboy problem under the worst-case and best-case scenarios.
Eur. J. Oper. Res.
Jerzy Kamburowski
2012 J jnl
An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times.
Comput. Oper. Res.
Pawel Jan Kalczynski, Jerzy Kamburowski
2009 J jnl
An empirical analysis of the optimality rate of flow shop heuristics.
Eur. J. Oper. Res.
Pawel Jan Kalczynski, Jerzy Kamburowski
2008 J jnl
An improved NEH heuristic to minimize makespan in permutation flow shops.
Comput. Oper. Res.
Pawel Jan Kalczynski, Jerzy Kamburowski
2007 J jnl
On no-wait and no-idle flow shops with makespan criterion.
Eur. J. Oper. Res.
Pawel Jan Kalczynski, Jerzy Kamburowski
2006 J jnl
A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation.
Eur. J. Oper. Res.
Pawel Jan Kalczynski, Jerzy Kamburowski
2005 J jnl
A heuristic for minimizing the makespan in no-idle permutation flow shops.
Comput. Ind. Eng.
Pawel Jan Kalczynski, Jerzy Kamburowski
2005 J jnl
Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem.
J. Sched.
Pawel Jan Kalczynski, Jerzy Kamburowski
2004 J jnl
Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops.
J. Oper. Res. Soc.
Pawel Jan Kalczynski, Jerzy Kamburowski
2004 J jnl
More on three-machine no-idle flow shops.
Comput. Ind. Eng.
Jerzy Kamburowski
2000 J jnl
Minimizing the complexity of an activity network.
Networks
Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann
2000 J jnl
On three-machine flow shops with random job processing times.
Eur. J. Oper. Res.
Jerzy Kamburowski
1999 J jnl
Stochastically minimizing the makespan in two-machine flow shops without blocking.
Eur. J. Oper. Res.
Jerzy Kamburowski
1992 J jnl
Bounding the distribution of project duration in PERT networks.
Oper. Res. Lett.
Jerzy Kamburowski
1992 J jnl
Optimal Reductions of Two-Terminal Directed Acyclic Graphs.
SIAM J. Comput.
Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann
1991 J jnl
Minimum flows in (s,
Networks
Veena Adlakha, Barbara Gladysz, Jerzy Kamburowski
1985 J jnl
Technical Note - A Note on the Stochastic Shortest Route Problem.
Oper. Res.
Jerzy Kamburowski
1984 J jnl
Some remarks on the expected delay of project duration in a PERT network.
Z. Oper. Research
Jerzy Kamburowski