Jerzy Kamburowski

发表

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

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

Technical Note - A Note on the Stochastic Shortest Route Problem

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

Bounding the distribution of project duration in PERT networks

Jerzy Kamburowski, 1992, Oper. Res. Lett..

On the minimum cost project schedule

Jerzy Kamburowski, J. Kamburowski, 1995 .

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

Jerzy Kamburowski, Pawel Jan Kalczynski, 2012, Comput. Oper. Res..

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

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

Minimum flows in (s, t) planar networks

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

New validations of PERT times

Jerzy Kamburowski, J. Kamburowski, 1997 .

On the Asymptotic Optimality of Scheduling Heuristics

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

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

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

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, 2015, Eur. J. Oper. Res..

The distribution-free newsboy problem and the demand skew

Jerzy Kamburowski, J. Kamburowski, 2015, Int. Trans. 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..

Non-bottleneck machines in three-machine flow shops

Jerzy Kamburowski, J. Kamburowski, 2000 .

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

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

On three-machine flow shops with random job processing times

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

An empirical analysis of the optimality rate of flow shop heuristics

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

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

Jerzy Kamburowski, Pawel Jan Kalczynski, 2005, J. Sched..

An improved NEH heuristic to minimize makespan in permutation flow shops

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

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..

On the Unknown Contribution of Stefan Chanas to the Stochastic Flow Shop Analysis

Jerzy Kamburowski, 2003 .

Erratum: Normally Distributed Activity Durations in PERT Networks

Jerzy Kamburowski, 1986 .

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

Jerzy Kamburowski, 1984, Z. Oper. Research.

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

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

Minimizing the complexity of an activity network

Jerzy Kamburowski, Matthias F. Stallmann, David J. Michael, 2000, Networks.

More on three-machine no-idle flow shops

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

Optimal Reductions of Two-Terminal Directed Acyclic Graphs

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

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..

An upper bound on the expected completion time of PERT networks

Jerzy Kamburowski, J. Kamburowski, 1985 .

Minimizing the complexity of an activity network

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

The nature of simplicity of Johnson's algorithm

Jerzy Kamburowski, 1997 .

Two-point approximations for activity times in PERT networks

Jerzy Kamburowski, 1985 .

ON THE MINIMUM DUMMY-ARC PROBLEM (*)

Jerzy Kamburowski, David J. Michael, 1993 .