George Steiner, Ph.D

Professor of Operations Management

Office: MGD 415

Phone: (905) 525-9140 x23947

Degrees:

Ph.D. (Combinatorics and Optimization) The University of Waterloo, Waterloo, Ont., Canada, 1982.
M.Sc. (Mathematics) Loránd Eötvös University, Budapest, Hungary, 1971.

Research Interests:

Scheduling
Algorithms on Graphs and Partially Ordered Sets
Combinatorial Optimization

Consulting Work:

Scheduling and Production Planning

Teaching:

Management Science/Operations Research
Operations Management

Publications:

Recent publications include:

E. Selvarajah and G. Steiner: “Approximation Algorithms for the Supplier’s Supply Chain Scheduling Problem”, accepted for publication in Operations Research, Feb. 2008.

D. Shabtay and G. Steiner: “The Single-Machine Earliness-Tardiness Problem with Due Date Assignment and Controllable Processing Times”, Annals of Operations Research, 159 (2008), pp. 25-40.

D. Shabtay and G. Steiner: “Optimal Due Date Assignment in Multi-machine Scheduling Environments” J. of Scheduling, 11 (2008), pp. 217-228.

G. Steiner and P. Stephenson: “Pareto Optima for Total Weighted Completion Time and Maximum Lateness on a Single Machine”, Discrete Applied Mathematics, 155 (2007), pp. 2341-2354.

G. Steiner and R. Zhang: “Minimizing the Weighted Number of Late Jobs with Batch Setup Times and Delivery Costs on a Single Machine”, in Multiprocessor Scheduling: Theory and Applications, (E. Levner ed.), pp. 85-98, I-Tech Publ., Vienna, 2007.

D. Shabtay and G. Steiner: “A Survey of Scheduling with Controllable Processing Times”, Discrete Applied Mathematics, 155 (2007), pp. 1643-1666.

G. Steiner and R. Zhang: “Minimizing the Total Weighted Number of Late Jobs with Late Deliveries in Two-level Supply Chains”, Multidisciplinary Scheduling: Theory and Applications, 3 (2007), pp. 447-454.

S. Kolliopoulos and G. Steiner: “Approximation Algorithms for Scheduling Problems with a Modified Total Weighted Tardiness Objective”, Operations Research Letters, 35 (2007), pp. 685-692.

M. Kaspi, D. Shabtay and G. Steiner: “The No-wait Two-machine Flow-shop Scheduling Problem with Convex Resource-Dependent Processing Times”, IIE Transactions, 39 (2007), pp. 539-557. (This paper was co-winner of the ORSIS 2007 Prize awarded by the Operations Research Society of Israel to the best paper of the year.)

D. Shabtay and G. Steiner: “Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine”, Manufacturing and Service Operations Management, 9 (2007), pp. 332-350.

D. Shabtay and G. Steiner: “Single-Machine Batch Scheduling to Minimize Total Completion Time and Resource Consumption Costs”, Journal of Scheduling, 10 (2007), pp. 255-261.

S. Kolliopoulos and G. Steiner: “Partially Ordered Knapsack and Scheduling”, Discrete Applied Mathematics, 155 (2007), pp. 889-897.

S. Kolliopoulos and G. Steiner: “Approximation Algorithms for Minimizing the Total Weighted Tardiness on a Single Machine”, Theoretical Computer Science, 355 (2006), pp. 261 – 273.

D. Shabtay and G. Steiner: “Two Due Date Assignment Problems in Scheduling a Single Machine”, Operations Research Letters, 34 (2006), pp. 683 - 691.

E. Selvarajah and G. Steiner: “Batch Scheduling in Customer-Centric Supply Chains”, Journal of the Operations Research Society of Japan, 49 (2006), pp. 174-187.

G. Steiner and Z. Xue: “On the Connection Between a Cyclic Job Shop and a Reentrant Flow Shop Scheduling Problem”, Journal of Scheduling, 9 (2006), pp. 381- 387.

G. Steiner and Z. Xue: “Minimizing Makespan in a Two-Machine Reentrant Flow Shop”, Discrete Applied Mathematics, 154(2006), pp. 604-605.

E. Selvarajah and G. Steiner: “Batch Scheduling in a Two-level Supply Chain: A Focus on the Supplier”, European Journal of Operational Research, 173 (2006), pp. 226 - 240.

J. Li and G. Steiner: “Partitioning a Bipartite Graph into Vertex-Disjoint Paths”, Ars Combinatoria, 81 (2006), pp. 161-173.

V. Deineko, G. Steiner and Z. Xue: “Robotic Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices”, Journal of Combinatorial Optimization, 9 (2005), pp. 381-399.

G. Steiner and Z. Xue: “Scheduling in Reentrant Robotic Cells: Algorithms and Complexity”, Journal of Scheduling, 8 (2005), pp. 25-48.

D. Shabtay and G. Steiner: “The Single-Machine Earliness-Tardiness Problem with Due Date Assignment and Resource Dependent Processing Times”, Multidisciplinary Scheduling: Theory and Applications, 1 (2005), pp. 149-161.

G. Steiner and Z. Xue: “The Maximum Traveling Salesman Problem on van der Veen Matrices”, Discrete Applied Mathematics, 146 (2005), pp. 1-2.

J. Li and G. Steiner: “Partitioning a Graph into Vertex-Disjoint Paths”, Studia Scientiarum Mathematicarum Hungarica, 42 (2005), pp. 277-294.

G. Steiner and P. Stephenson: “Dominance Orders for Scheduling Problems” Proceedings of ISS04 (International Symposium on Scheduling), Yumebutai, Japan, pp. 57-61.

S. Kolliopoulos and G. Steiner: “Minimizing the Total Weighted Tardiness on a Single Machine with Fixed Number of Due Dates,” Lecture Notes in Computer Science, 2996 (2004), pp.176 -186.

J. Cheng, H. Kise, G. Steiner and P. Stephenson: “Branch and Bound Algorithms with Fuzzy Heuristics for Permutation Flow Shop Scheduling Problems”, Fuzzy Set Based Heuristics for Optimization (J.L. Verdagay ed.), 126 (2003), pp. 21-36.

G. Steiner: “On the k-path Partition of Graphs”, Theoretical Computer Science, 290 (2003), pp. 2147-2155.

J. Chen and G. Steiner: “On Discrete Lot Streaming in No-Wait Flow Shops”, IIE Transactions, 35 (2003), pp. 91-101.

S. Kolliopoulos and G. Steiner: “Partially Ordered Knapsack with Applications in Scheduling”, Lecture Notes in Computer Science, 2461 (2002), pp. 612 – 624

J. Cheng, G. Steiner and P. Stephenson: “Fast Algorithms to Minimize the Makespan or Maximum Lateness in the Two-Machine Flow Shop with Release Times”, Journal of Scheduling, 5 (2002), pp. 71-92.

M. Habib, R. Medina, L. Nourine and G. Steiner: “Efficient Algorithms on Distributive Lattices”, Discrete Applied Mathematics 110 (2001), pp. 169-187.

J. Cheng, G. Steiner and P. Stephenson: “A Computational Study with a New Algorithm for the Permutation Flow-Shop Problem with Release Times”, European Journal of Operational Research, 130 (2001), pp. 559-575.

G. Steiner: “On the k-path Partition Problem in Cographs”, Congressus Numerantium, 147 (2000), pp. 89-96.

G. Steiner and P. Stephenson: “Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems”, SIAM J. on Discrete Mathematics, 13 (2000), pp. 419-435.