College of Business and Innovation

Dr. Jerzy Kamburowski

placeholder

Professor
Department:
Information Operations & Technology Management
Office: Stranahan Hall - 4026
Telephone: (419) 530 - 4361
Fax: (419) 530 - 2290
Email
 

European Habilitation, Wroclaw Academy of Economics, Poland,1988

Doctor of Philosophy (PhD), Wroclaw University of Technology, Poland,1980

Masters, Wroclaw University of Technology, Poland,1977

Articles in Referred Journals

  • The distribution-free newsboy problem and the demand skew, International Transactions of Operational Research, 2015, vol. 22, 926-946.
  • On the distribution free newsboy problem with some non-skewed demands, Operations Research Letters, 2015, vol. 43, 165-171.
  • The distribution-free newsboy problem under the worst-case and best-case scenarios, European Journal of Operational Research, 2014, vol. 237, 106-112
  • An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (with P.J. Kalczynski), Computers and Operations Research, 2012, vol. 216, 172-177.
  • Empirical versus theoretical worst case performance of flow shop heuristics (with P.J. Kalczynski). International Journal of Operations and Quantitative Management, 2012, vol. 18, 307-317.
  • An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times  (with P.J. Kalczynski), Computers and Operations Research (in press)
  • Empirical versus theoretical worst case performance of flow shop heuristics (with P.J. Kalczynski), International Journal of Operations and Quantitative Management (in press)
  • On recent modifications and extensions of the NEH heuristic for flow shop sequencing (with P.J. Kalczynski), Foundations of Computing and Decision Sciences, 2011, vol 36, 17 - 34.
  • An empirical analysis of the optimality rate of some flow shop heuristics (with P.J. Kalczynski), European Journal of Operational Research, 2009, vol. 198, 93 - 101.
  • An improved NEH heuristic to minimize makespan in permutation flow shops (with P.J. Kalczynski), Computers & Operations Research, 2008, vol. 35, 3001 - 3008.  
  • On no-wait and no-idle flow shops with makespan criterion (with P.J. Kalczynski), European Journal of Operational Research, 2007, vol. 178, 677-685.
  • On the NEH heuristic for minimizing the makespan in permutation flow shops (with P.J. Kalczynski), Omega, International Journal of Management Science, 2007, vol. 35, 53-60.
  • 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, vol. 169, 742 – 750.
  • Two-machine stochastic flow shops with blocking and the traveling salesman problem (with P.J.Kalczynski), Journal of Scheduling, 2005, vol. 8., 529 – 536.
  • A heuristic for minimizing the makespan in no-idle flow shops (with P.J. Kalczynski), Computers & Industrial Engineering, 2005, vol. 49, 146-154
  • 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.
  • More on three-machine no-idle flow shops, Computers & Industrial Engineering, 2004, vol. 46, 461-466.
  • On the unknown contribution of Stefan Chanas to the stochastic flow shop analysis (in memory), Operations Research and Decisions, 2003, No.4, 75-83.
  • On three-machine flow shops with random job processing times, European Journal of Operational Research, 2000, vol. 125, 440-449.
  • Non-Bottleneck Machines in Three-Machine Flow Shops, Journal of Scheduling, 2000, vol. 3, 209-233
  • Stochastically Minimizing the Makespan in Two-Machine Flow Shops without Blocking, European Journal of Operational Research, 1999, vol. 112, No. 2 ,304-309
  • The Nature of Simplicity of Johnson's Algorithm, Omega, The International Journal of Management Science 25, 1997, 581-584.
  • New Validations of PERT Times, Omega, The International Journal of Management Science 25, 1997, 323-328.
  • On the Minimum Cost Project Schedule, Omega, The International Journal of Management Science 23, 1995, 463-465.
  • On the minimum dummy-arc problem (with D.J. Michael & M.F.M. Stallmann).RAIRO Operations Research 27, 1993, 153-168.
  • Bounding the Distribution of Project Duration in PERT Networks. Operations Research Letters 12, 1992, 17-22.
  • Optimal Reduction of Two-Terminal Directed Acyclic Graphs (with W.W.Bein & M.F.M. Stallmann). SIAM Journal on Computing 21, 1992, 1112-1129.
  • The Analysis of Activity Networks under Generalized Precedence Relations (GPRs) (with S.E. Elmaghraby). Management Science 38, 1992, 1245-1263.
  • The Minimum Cost Flow Problem in Stochastic Flow Networks Analysis (with S. Chanas & Z. Nowak). Przeglad Statystyczny XXXIX, 1992, 88-93.
  • Minimum Flows in (s,t) Planar Networks (with V. Adlakha & B. Gladysz). Networks 21, 1991, 767-773.
  • On Project Representation and Activity Floats (with S.E. Elmaghraby). Arabian Journal for Science and Engineering 15:4B, 1990, 627-637.
  • Bounds on the Mean of the Maximum of a Number of Normal Random Variables. Statistics 20, 1989, 475-481.
  • On the Minimal Flow Problem in Directed s-t Planar Networks (in Polish), (with B. Gladysz). Nauki o Zarzadzaniu, No. 2, 1987, 157-167.
  • Upper Bound in Project Completion Time with Incomplete Probabilistic Information (in Polish). Przeglad Statystyczny XXXIII, 1986, 41-47.
  • On the Computational Complexity of the Shortest Route and Maximum Flow Problems in Stochastic Networks. Foundations of Control Engineering 11, 1986, 167-175.
  • A Note on Bounds for the Moments of a Stochastic Project Planning Model Duration. Journal of Information and Optimization Sciences 7, 1986, 303-309.
  • Some Remarks about the Use of Stochastic Programming in Analyzing PERT Networks (in Polish). Przeglad Statystyczny XXXII, 1985, 173-174.
  • Bounds in Temporal Analysis of Stochastic Networks. Foundations of Control Engineering 10, 1985, 177-189.
  • Normally Distributed Activity Durations in PERT Networks. Journal of Operational Research Society 36, 1985, 1051-1057, Corrigendum vol. 37, 1986, 529.
  • Upper Bounds on Expected Completion Time in PERT Networks (in Polish). Przeglad Statystyczny XXXII, 1985, 63-68.
  • Two-Point Approximations for Activity Times in PERT Networks. RAIRO Recherche Operationelle/Operations Research 19, 1985, 301-313.
  • Flow Distributions Through a Stochastic Acyclic Network. Systems Science 10, No. 2, 1984, 25-35.
  • An Upper Bound on the Expected Completion Time of PERT Networks. European Journal of Operational Research 21, 1985, 206-212.
  • A Note on the Stochastic Shortest Route Problem. Operations Research 33, 1985, 696-698.
  • The Use of GERT Networks in Construction Processes (in Polish, with A. Nowak). Problemy Rozwoju Budownictwa, No.4, 1984, 21-24.
  • Some Remarks on the Expected Delay of Project Duration in a PERT Network. Zeitschrift fur Operations Research 28, 1984, B221-B225.
  • Resource Demand in the PERT Type Network. Ekonomicko Mathematicky Obzor 20, 1984, 171-179.
  • Criticality Indices in PERT Networks (in Polish). Przeglad Statystyczny XXXII, 1984, 295-299.
  • Resource Planning for Projects with Random Activity Duration Times. Wissenschaftliche Beitrage der TH Wismar, NO.7.2./82, 1982, 107-110.
  • The Use of Fuzzy Variables in PERT (with S. Chanas). Fuzzy Sets and Systems 5, 1981, 11-19.
  • Analytical and Simulation Determination of Resources in Projects with Uncertain Activity Durations (in Polish, with A. Pelech). Z Teorii i Praktyki Zarzadzania, TNOiK, Wroclaw 1980, 75-87.
  • Time-Optimal Structures in Alternative Decision Networks (in Polish, with S. Chanas). Przeglad Statystyczny XXVI, 1979, 161-168.

Books and Monographs (refereed)

  • PERT Networks under Incomplete Probabilistic Information. Chapter in: Advances in Project Scheduling, Studies in Production and Engineering Economics 9, Elsevier, 1989, 433-466.
  • Extremal Paths and Flows in Stochastic Networks (in Polish). Technical University of Wroclaw, Monographs No.13, Wroclaw, 1987.
  • Activity Networks. Chapter in: Operations Research in Management (in Polish), PWN, Warsaw, 1985, 367-412.

Proceedings (Refereed)

  • The newsvendor problem with high and low priority customers (summarry), (with Bo Li, Udayan Nandkeolyar, and P.S. Sundar), Proceedings of the DSI National Meeting, Boston, November 2011
  • A new extension of the NEH heuristic for flow shop sequencing (with P.J. Kalczynski), Proceedings of the DSI National Meeting,  San Diego, November 2010.
  • Machine aggregation in flow shop scheduling (with P.J. Kalczynski), Proceedings of the DSI National Meeting, New Orleans, November 2009
  • Is this yet another anomaly in operations research? (with P.J. Kalczynski),  Proceedings of the SEDSI Meeting,  Charleston,  SC, February 2009.
  • On the performance of some flow shop heuristics (with P.J. Kalczynski),  Proceedings of DSI National Meeting, Phoenix, Arizona, November 2007
  • On the solution space of Johnson’ scheduling problem (with P.J. Kalczynski and B. Wierwille), Proceedings of DSI National Meeting, Phoenix, Arizona, November 2007 
  • A new heuristic for the permutation flowshop problem (with P.J. Kalczynski), Proceedings of the South-Western Decision Sciences Institute Meeting, San Diego, CA, 2007 
  • On three-machine no-wait flow shops, Proceedings of the Decision Sciences Institute Annual Meeting, San Francisco, CA, 2005 
  • On pairwise job interchange in two-machine flow shops with random processing times, Proceedings of the Decision Sciences Institute Annual Meeting, Washington, DC, 2003 
  • Three-machine flow shops with time lags and series-parallel precedence constraints, Proceedings of the Western Decision Sciences Institute Annual Meeting, Kaui, 2003, 681-684 
  • Two-machine flow shops with time lags, Proceedings of the Western Decision Science Institute Annual Meeting, Las Vegas, 2002, 667-669 
  • Deterministic versus exponential job processing times in permutation flow shops, Proceedings of the Western Decision Science Institute Annual Meeting, Vancouver, 2001 
  • Advances in three-machine flow shop analysis, Proceedings of the Midwest Decision Science Institute Annual Meeting, Chicago, 2000, 129-131 
  • On Some Extensions of Johnson's Algorithm (summary), Proceedings of the Decision Science Institute Annual Meeting, Las Vegas, 1998, 1072. 
  • Dominance Relations in Three-Machine flow shop , proceedings of Decision Science Institute Annual Meeting, New Orleans, 1999
  • On Two Machine Stochastic Flow Shops (with Dhamodararaj Kannan), Proceedings of the Decision Science Institute Annual Meeting, San Diego, 1997, 930-932.
  • More on PERT Times (summary), Proceedings of the Decision Sciences Institute Annual Meeting, San Diego, 1977, 895.
  • On the Activity Time Distribution, Proceedings of the Annual Meeting of Midwest Decision Science Institute, Indianapolis 1997,187-189.
  • On Maximizing the Net Present Value in Project Scheduling, Proceedings of the Decision Sciences Institute 27th Annual Meeting, Orlando, 1996, 1082-1084.
  • PERT Networks under Limited Resources, Proceedings of the Northeast Decision Sciences Institute, St.Croix, Virgin Islands, 1996, 414-416.
  • Resource Requirements in Stochastic PERT Networks (Summary), Proceedings of the Decision Sciences Institute 26th Annual Meeting, Boston, 1995, 935.
  • Simple Bounds on the Expected Project Duration in PERT, Proceedings of the Decision Sciences Institute 25th Annual Meeting, Honolulu, 1994,1263-1265.
  • Project Crashing in CPM Networks, Proceedings of the Decision Sciences Institute 24th Annual Meeting, Washington, 1993, 1099-1101.
  • Optimal Construction of Project Activity Networks (with D.J. Michael and M.F.M. Stallmann), Proceedings of the Decision Sciences Institute 23rd Annual Meeting, San Francisco, 1992, 1424-1426.
  • Minimizing the Expected Makespan in Two Machines Stochatic Flow Shop (summary) (with M. Wermus), Miami Beach, Proceedings of the Decision Sciences Institute 22nd Annual Meeting, Miami Beach, 1991, 989.
  • Maximizing the Project Net Present Value in Activity Networks under Generalized Precedence Relations, Proceedings of the Decision Sciences Institute 21st Annual Meeting, San Diego, 1990, 748-750.
  • On Project Representation and Activity Floats (summary), Proceedings of the Decision Sciences Institute 20th Annual Meeting, New Orleans, 1989, 1142.
  • An Overview of the Computational Complexity of the PERT, Shortest Route and Maximum Flow Problems in Stochastic Networks. Proceedings of the Advanced School "Stochastics in Combinatorial Optimization", CIMS Udine, Italy, World Scientific, Singapore, 1987, 187-196.
  • On the Computational Complexity of Selected Network Problems (in Polish). Formulating and Applying Economical Models, SGPiS, Warsaw, 1987, 107-123.
  • The Use of Monte Carlo Method in Stochastic Network Analysis. V. Kolloquium Anwendung Mathematischer Methoden in Technik, Technologie und Okonomie, Wissennschaftliche Beitrage, TH Wismar 3/85, 1985,30-31.
  • The Fuzzy Shortest Route Problem (with S. Chanas). Proceedings of the Polish Symposium on Interval and Fuzzy Mathematics, Poznan, 1983, Uniwersytet Poznanski 1985, 35-41.
  • Identification of the Shortest Route in Stochastic Networks. Proceedings of Third International Conference on Systems Engineering, Wright State University, Dayton, 1984, 295-299.
  • Efficiency of Methods for Analyzing Stochastic Models of Projects (in Polish). Materialy Konferencyjne SYPRO'84, Politechnika Warszawska, 1984, 49-57.
  • Width of the Project in PERT Networks. Prace Naukowe Instytutu Organizacji i Zarzadzania Politechniki Wroclawskiej, No.39, Konferencje No.15, 1983, 50-56.
  • Fuzzy Activity Duration Times in Critical Path Analysis. International Symposium on Project Management, New Delhi, 1983, 192-199.
  • Optimization of Resources Allocation to Expedite Project Completion Time under Fuzzy Constraints (in Polish). Prace Naukowe Inst. Org. i Zarz. Pol. Wr., No.21, Konferencje No.7, 1978, 283-290.

Proceedings (unrefereed)

  • On the reduction of Acyclic Digraphs and its Applications (summary) (with S.E. Elmaghraby and M.F.M. Stallmann). TIMS/ORSA Joint National Meeting, Las Vegas, 1990, p.102.

Courses taught: Operations Research, Management Science, Business Statistics, Operations Management, and Mathematical Methods in Management, Decision Theory, Mathematical Programming, and Project Management.

Courses taught at the University of Toledo:

  • ISOM 320: Introduction to Operations Management
  • ISOM 331: Introduction to Management Science
  • ISOM 573: Management Science Techniques
  • ISOM 421/651: Project Management
  • ISOM 552/752: Principles of Operations Management
  • ISOM 376: Management Science Cases and Applications
  • MKTG 347: Business Fluctuations and Forecasting
  • BUAD 2060: Data Analysis for Business
  • BUAD 2070: Applications of Statistics in Business Decision Making
  • OPMT 3310: Computer and Model Based Business Decision Making
  • OPMT 3750/6180: Applied Regression Analysis
  • OPMT 4450/6100: Business Forecasting
  • OPMT 5510: Business Statistics with Computer Applications
  • OPMT 5730: Modeling and Analysis for Manufacturing
  • OPMT 6510: Project Management
  • MFGM 8630: Management Science
Deterministic and Stochastic Scheduling

Stochastic Inventory

President of Wroclaw University of Technology Research Awards: 1981, 1985, 1986, 1987 and 1988

Polish Academy of Sciences Award for Research: 1988

Polish Minister of Education Award: 1989

College of Business Administration of University of Toledo Research Award, 2001

College of Business and Innovation of University of Toledo Best Paper Award, 2010

Last Updated: 11/3/16