Jerzy Kamburowski

Publication Activity (10 Years)

Years Active: 1984-2015
Publications (10 Years): 0

Top Topics

Deteriorating Jobs

Normal Distribution

Top Venues

Eur. J. Oper. Res.

Oper. Res. Lett.

Comput. Oper. Res.

Int. Trans. Oper. Res.

Publications

Jerzy Kamburowski
The distribution-free newsboy problem and the demand skew. Int. Trans. Oper. Res. 22 (5) (2015)
Jerzy Kamburowski
On the distribution-free newsboy problem with some non-skewed demands. Oper. Res. Lett. 43 (2) (2015)
Jerzy Kamburowski
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. 240 (1) (2015)
Jerzy Kamburowski
The distribution-free newsboy problem under the worst-case and best-case scenarios. Eur. J. Oper. Res. 237 (1) (2014)
Pawel Jan Kalczynski, Jerzy Kamburowski
An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times. Comput. Oper. Res. 39 (11) (2012)
Pawel Jan Kalczynski, Jerzy Kamburowski
An empirical analysis of the optimality rate of flow shop heuristics. Eur. J. Oper. Res. 198 (1) (2009)
Pawel Jan Kalczynski, Jerzy Kamburowski
An improved NEH heuristic to minimize makespan in permutation flow shops. Comput. Oper. Res. 35 (9) (2008)
Pawel Jan Kalczynski, Jerzy Kamburowski
On no-wait and no-idle flow shops with makespan criterion. Eur. J. Oper. Res. 178 (3) (2007)
Pawel Jan Kalczynski, Jerzy Kamburowski
A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation. Eur. J. Oper. Res. 169 (3) (2006)
Pawel Jan Kalczynski, Jerzy Kamburowski
Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem. J. Sched. 8 (6) (2005)
Pawel Jan Kalczynski, Jerzy Kamburowski
A heuristic for minimizing the makespan in no-idle permutation flow shops. Comput. Ind. Eng. 49 (1) (2005)
Jerzy Kamburowski
More on three-machine no-idle flow shops. Comput. Ind. Eng. 46 (3) (2004)
Pawel Jan Kalczynski, Jerzy Kamburowski
Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops. J. Oper. Res. Soc. 55 (12) (2004)
Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann
Minimizing the complexity of an activity network. Networks 36 (1) (2000)
Jerzy Kamburowski
On three-machine flow shops with random job processing times. Eur. J. Oper. Res. 125 (2) (2000)
Jerzy Kamburowski
Stochastically minimizing the makespan in two-machine flow shops without blocking. Eur. J. Oper. Res. 112 (2) (1999)
Jerzy Kamburowski
Bounding the distribution of project duration in PERT networks. Oper. Res. Lett. 12 (1) (1992)
Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann
Optimal Reductions of Two-Terminal Directed Acyclic Graphs. SIAM J. Comput. 21 (6) (1992)
Veena Adlakha, Barbara Gladysz, Jerzy Kamburowski
) planar networks. Networks 21 (7) (1991)
Jerzy Kamburowski
Technical Note - A Note on the Stochastic Shortest Route Problem. Oper. Res. 33 (3) (1985)
Jerzy Kamburowski
Some remarks on the expected delay of project duration in a PERT network. Z. Oper. Research 28 (6) (1984)