Single Machine Scheduling with Precedence Constraints of Dimension 2. - George Steiner (Math. Oper. Res., 1984)

Mathematical aspects of scheduling and applications, by R. Bellman, A. O. Esogbue, and I. Nabeshima, Pergamon, London, 1982, 329 pp. Price: $19.50. - George Steiner (Networks, 1984)

A compact labeling scheme for series-parallel graphs. - George Steiner (Discret. Appl. Math., 1985)

Optimal Sequencing by Modular Decomposition: Polynomial Algorithms. - Jeffrey B. Sidney; George Steiner (Oper. Res., 1986)

Searching in 2-Dimensional Partial Orders. - George Steiner (J. Algorithms, 1987)

Minimizing bumps in ordered sets by substitution decomposition. - George Steiner (Discret. Math., 1989)

Permutation Schedules for Flow Shops with Precedence Constraints. - Kevin Ewacha; Ivan Rival; George Steiner (Oper. Res., 1990)

Hamiltonian Cycle is Polynomial on Cocomparability Graphs. - Jitender S. Deogun; George Steiner (Discret. Appl. Math., 1992)

A Note on "Scheduling Unit-Time Tasks with Integer Release Times and Deadlines". - George Steiner; Scott Yeomans (Inf. Process. Lett., 1993)

Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs. - Jitender S. Deogun; George Steiner (SIAM J. Comput., 1994)

The recognition of indifference digraphs and generalized semiorders. - George Steiner (J. Graph Theory, 1996)

Optimal level schedules for mixed-model, multi-level just-in-time assembly systems. - Wieslaw Kubiak; George Steiner; Julian Scott Yeomans (Ann. Oper. Res., 1997)

A poset-based method for counting partitions and Ferrers diagrams. - George Steiner (Ars Comb., 1997)

Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates. - George Steiner (Discret. Appl. Math., 1997)

1-Tough cocomparability graphs are hamiltonian. - Jitender S. Deogun; Dieter Kratsch; George Steiner (Discret. Math., 1997)

An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. - Jitender S. Deogun; Dieter Kratsch; George Steiner (Inf. Process. Lett., 1997)

Gray Codes for the Ideals of Interval Orders. - Michel Habib; Lhouari Nourine; George Steiner (J. Algorithms, 1997)

Approximation methods for discrete lot streaming in flow shops. - Jiang Chen; George Steiner (Oper. Res. Lett., 1997)

Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems. - George Steiner; Paul Stephenson (SIAM J. Discret. Math., 2000)

Efficient algorithms on distributive lattices. - Michel Habib; Raoul Medina; Lhouari Nourine; George Steiner (Discret. Appl. Math., 2001)

A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. - Jinliang Cheng; George Steiner; Paul Stephenson (Eur. J. Oper. Res., 2001)

On the k-path partition of graphs. - George Steiner (Theor. Comput. Sci., 2003)

On Minimizing the Total Weighted Tardiness on a Single Machine. - Stavros G. Kolliopoulos; George Steiner (STACS, 2004)

The maximum traveling salesman problem on van der Veen matrices. - George Steiner; Zhihui Xue (Discret. Appl. Math., 2005)

Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. - Vladimir G. Deineko; George Steiner; Zhihui Xue (J. Comb. Optim., 2005)

Scheduling in Reentrant Robotic Cells: Algorithms and Complexity. - George Steiner; Zhihui Xue (J. Sched., 2005)

Partioning A Bipartite Graph into Vertex-Disjoint Paths. - Jianping Li; George Steiner (Ars Comb., 2006)

Batch scheduling in a two-level supply chain - a focus on the supplier. - Esaignani Selvarajah; George Steiner (Eur. J. Oper. Res., 2006)

Two due date assignment problems in scheduling a single machine. - Dvir Shabtay; George Steiner (Oper. Res. Lett., 2006)

On the connection between a cyclic job shop and a reentrant flow shop scheduling problem. - George Steiner; Zhihui Xue (J. Sched., 2006)

Approximation algorithms for minimizing the total weighted tardiness on a single machine. - Stavros G. Kolliopoulos; George Steiner (Theor. Comput. Sci., 2006)

Partially ordered knapsack and applications to scheduling. - Stavros G. Kolliopoulos; George Steiner (Discret. Appl. Math., 2007)

A survey of scheduling with controllable processing times. - Dvir Shabtay; George Steiner (Discret. Appl. Math., 2007)

Pareto optima for total weighted completion time and maximum lateness on a single machine. - George Steiner; Paul Stephenson (Discret. Appl. Math., 2007)

Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine. - Dvir Shabtay; George Steiner (Manuf. Serv. Oper. Manag., 2007)

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective. - Stavros G. Kolliopoulos; George Steiner (Oper. Res. Lett., 2007)

Single machine batch scheduling to minimize total completion time and resource consumption costs. - Dvir Shabtay; George Steiner (J. Sched., 2007)

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. - Dvir Shabtay; George Steiner (Ann. Oper. Res., 2008)

Optimal due date assignment in multi-machine scheduling environments. - Dvir Shabtay; George Steiner (J. Sched., 2008)

The bipartite margin shop and maximum red matchings free of blue-red alternating cycles. - Daniel Oron; George Steiner; Vadim G. Timkovsky (Discret. Optim., 2009)

Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs. - Esaignani Selvarajah; George Steiner (Oper. Res., 2009)

Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains. - George Steiner; Rui Zhang (J. Sched., 2009)

'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders. - Moshe Dror; George Steiner (Discret. Appl. Math., 2010)

Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments. - Dvir Shabtay; George Steiner; Liron Yedidsion (Discret. Appl. Math., 2010)

A unified approach for scheduling with convex resource consumption functions using positional penalties. - Yaron Leyvand; Dvir Shabtay; George Steiner (Eur. J. Oper. Res., 2010)

Just-in-time scheduling with controllable processing times on parallel machines. - Yaron Leyvand; Dvir Shabtay; George Steiner; Liron Yedidsion (J. Comb. Optim., 2010)

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries. - George Steiner; Rui Zhang (Ann. Oper. Res., 2011)

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. - Vladimir G. Deineko; Dvir Shabtay; George Steiner (J. Heuristics, 2011)

Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties. - George Steiner; Rui Zhang (Oper. Res., 2011)

A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. - Dvir Shabtay; George Steiner (J. Sched., 2011)

Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine. - Jianbo Qian; George Steiner (Eur. J. Oper. Res., 2013)

Single machine batch scheduling with release times and delivery costs. - Esaignani Selvarajah; George Steiner; Rui Zhang (J. Sched., 2013)

Single-machine scheduling with periodic maintenance to minimize makespan revisited. - Xianyu Yu; Yulin Zhang; George Steiner (J. Sched., 2014)

A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. - Dvir Shabtay; George Steiner; Liron Yedidsion (Discret. Appl. Math., 2015)

Single machine scheduling with two competing agents and equal job processing times. - Daniel Oron; Dvir Shabtay; George Steiner (Eur. J. Oper. Res., 2015)

Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs. - Sorina Dumitrescu; George Steiner; Rui Zhang (J. Sched., 2015)

Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times. - Daniel Oron; Dvir Shabtay; George Steiner (Eur. J. Oper. Res., 2017)

New results for scheduling to minimize tardiness on one machine with rejection and related problems. - Christos Koulamas; George Steiner (J. Sched., 2021)