J. Kamburowski

发表

The Analysis of Activity Networks Under Generalized Precedence Relations GPRs

S. Elmaghraby, J. Kamburowski, 1992 .

THE USE OF FUZZY VARIABLES IN PERT

S. Chanas, J. Kamburowski, 1981 .

Chapter 2 – PERT NETWORKS UNDER INCOMPLETE PROBABILISTIC INFORMATION

J. Kamburowski, J. Kamburowski, 1989 .

On the NEH heuristic for minimizing the makespan in permutation flow shops

J. Kamburowski, P. Kalczynski, 2007 .

Normally Distributed Activity Durations in PERT Networks

J. Kamburowski, 1985 .

A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration

J. Kamburowski, 1986 .

An upper bound on the expected completion time of PERT networks

Jerzy Kamburowski, J. Kamburowski, 1985 .

On the Asymptotic Optimality of Scheduling Heuristics

Jerzy Kamburowski, Pawel Jan Kalczynski, J. Kamburowski, 2012 .

An empirical analysis of the optimality rate of flow shop heuristics

Jerzy Kamburowski, Pawel Jan Kalczynski, J. Kamburowski, 2009, Eur. J. Oper. Res..

On Recent Modifications And Extensions Of The Neh Heuristic For Flow Shop Sequencing

Jerzy Kamburowski, Pawel Jan Kalczynski, J. Kamburowski, 2011 .

An improved NEH heuristic to minimize makespan in permutation flow shops

Jerzy Kamburowski, Pawel Jan Kalczynski, J. Kamburowski, 2008, Comput. Oper. Res..

Non-bottleneck machines in three-machine flow shops

Jerzy Kamburowski, J. Kamburowski, 2000 .

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

Jerzy Kamburowski, Pawel Jan Kalczynski, J. Kamburowski, 2006, Eur. J. Oper. Res..

OPTIMAL REDUCTION OF TWO-TERMINAL DIRECTED ACYCLIC GRAPHS *

J. Kamburowski, W. Bein, WOLFGANG, 1992 .

On the minimum cost project schedule

Jerzy Kamburowski, J. Kamburowski, 1995 .

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

Jerzy Kamburowski, Pawel Jan Kalczynski, J. Kamburowski, 2007, Eur. J. Oper. Res..

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

Jerzy Kamburowski, Pawel Jan Kalczynski, J. Kamburowski, 2004, J. Oper. Res. Soc..

More on three-machine no-idle flow shops

Jerzy Kamburowski, J. Kamburowski, 2004, Comput. Ind. Eng..

On three-machine flow shops with random job processing times

Jerzy Kamburowski, J. Kamburowski, 2000, Eur. J. Oper. Res..

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

Jerzy Kamburowski, J. Kamburowski, 1999, Eur. J. Oper. Res..

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

Jerzy Kamburowski, Pawel Jan Kalczynski, J. Kamburowski, 2005, Comput. Ind. Eng..

New validations of PERT times

Jerzy Kamburowski, J. Kamburowski, 1997 .

The distribution-free newsboy problem and the demand skew

Jerzy Kamburowski, J. Kamburowski, 2015, Int. Trans. Oper. Res..

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

Jerzy Kamburowski, J. Kamburowski, 2015, Oper. Res. Lett..

Minimum flows in (s, t) planar networks

Jerzy Kamburowski, Veena Adlakha, Barbara Gladysz, 1991, Networks.

Optimal Reductions of Two-Terminal Directed Acyclic Graphs

Jerzy Kamburowski, Wolfgang W. Bein, Matthias F. Stallmann, 1992, SIAM J. Comput..

Technical Note - A Note on the Stochastic Shortest Route Problem

Jerzy Kamburowski, J. Kamburowski, 1985, Oper. Res..