College of Business and Innovation

Faculty Research Detail - Jerzy Kamburowski, Ph.D.

Faculty Detail                      

Name: Jerzy Kamburowski, Ph.D.
Office: ST 4026
Phone: 419-530-4361

Biographical Sketch 
The Wroclaw University of Technology, Poland, Ph.D, Operations Management, 1980
The Wroclaw University of Technology, Poland, MS, Applied Mathematics, 1977

Dr. Kamburowski's research interest is focused on the theory of scheduling, and he is the author (or co-author) of more than 50 papers published in leading international journals in the area of Operations Research/Management Science.

Research Interests

Optimization, Shop Scheduling, Project Scheduling

Selected Publications


• A heuristic for minimizing the expected makespan in two-machine stochastic flow shops with

consistent coefficient of variation (with P.J. Kalczynski), European Journal of Operational Research

2006, to appear. (BR,R)

•  On the NEH heuristic for minimizing the makespan in permutation flow shops (with P.J.Kalczynski), Omega, International Journal of Management Science 2006 to appear (BR,R)

• Two-machine stochastic flow shops with blocking and the traveling salesman problem (with P.J.Kalczynski), Journal of Scheduling 2005, to appear. (BR,R).

• A heuristic for minimizing the makespan in no-idle flow shops (with P.J. Kalczynski), Computers &

Industrial Engineering, vol. 49, 2005, 146-154 (BR,R).

• Generalization of Johnson’s and Talwar’s scheduling rules in two-machine stochastic flow shops (with P.J. Kalczynski), Journal of the Operational Research Society, 2004, vol. 55, 1358-1362.(BR,R)

•  More on three-machine no-idle flow shops, Computers & Industrial Engineering, 2004, vol. 46, 461-466. (BR,R)

•  On the unknown contribution of Stefan Chanas to the stochastic flow shop analysis (in memory), Operations Research and Decisions, 2003, No.4, 75-83. (BR,R)

•  Non-bottleneck machines in three-machine flow shops, Journal of Scheduling, 2000, vol. 3, 209-233.


•  On three-machine flow shops with random job processing times, European Journal of Operational

Research, 2000, vol. 125, 440-449. (BR,R)

• Minimizing the complexity of an activity network (with D. Michael and M. Stallmann), Networks, 2000, vol. 36, No. 1, 47-52. (BR,R)

Last Updated: 6/26/15