Jerzy Kamburowski

According to our database, Jerzy Kamburowski authored at least 21 papers between 1984 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2015

On the distribution-free newsboy problem with some non-skewed demands.

Jerzy Kamburowski

Oper. Res. Lett., 2015

The distribution-free newsboy problem and the demand skew.

Jerzy Kamburowski

Int. Trans. Oper. Res., 2015

Corrigendum to "The distribution-free newsboy problem under the worst-case and best-case scenarios" [Eur. J. Oper. Res. 237(2014) 106-112].

Jerzy Kamburowski

Eur. J. Oper. Res., 2015

2014

The distribution-free newsboy problem under the worst-case and best-case scenarios.

Jerzy Kamburowski

Eur. J. Oper. Res., 2014

2012

An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times.

Pawel Jan Kalczynski, Jerzy Kamburowski

Comput. Oper. Res., 2012

2009

An empirical analysis of the optimality rate of flow shop heuristics.

Pawel Jan Kalczynski, Jerzy Kamburowski

Eur. J. Oper. Res., 2009

2008

An improved NEH heuristic to minimize makespan in permutation flow shops.

Pawel Jan Kalczynski, Jerzy Kamburowski

Comput. Oper. Res., 2008

2007

On no-wait and no-idle flow shops with makespan criterion.

Pawel Jan Kalczynski, Jerzy Kamburowski

Eur. J. Oper. Res., 2007

2006

A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation.

Pawel Jan Kalczynski, Jerzy Kamburowski

Eur. J. Oper. Res., 2006

2005

Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem.

Pawel Jan Kalczynski, Jerzy Kamburowski

J. Sched., 2005

A heuristic for minimizing the makespan in no-idle permutation flow shops.

Pawel Jan Kalczynski, Jerzy Kamburowski

Comput. Ind. Eng., 2005

2004

Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops.

Pawel Jan Kalczynski, Jerzy Kamburowski

J. Oper. Res. Soc., 2004

More on three-machine no-idle flow shops.

Jerzy Kamburowski

Comput. Ind. Eng., 2004

2000

Minimizing the complexity of an activity network.

Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann

Networks, 2000

On three-machine flow shops with random job processing times.

Jerzy Kamburowski

Eur. J. Oper. Res., 2000

1999

Stochastically minimizing the makespan in two-machine flow shops without blocking.

Jerzy Kamburowski

Eur. J. Oper. Res., 1999

1992

Optimal Reductions of Two-Terminal Directed Acyclic Graphs.

Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann

SIAM J. Comput., 1992

Bounding the distribution of project duration in PERT networks.

Jerzy Kamburowski

Oper. Res. Lett., 1992

1991

Minimum flows in (s, <i>t</i>) planar networks.

Veena Adlakha, Barbara Gladysz, Jerzy Kamburowski

Networks, 1991

1985

Technical Note - A Note on the Stochastic Shortest Route Problem.

Jerzy Kamburowski

Oper. Res., 1985

1984

Some remarks on the expected delay of project duration in a PERT network.

Jerzy Kamburowski

Z. Oper. Research, 1984