George Steiner

Publication Activity (10 Years)

Years Active: 1984-2021
Publications (10 Years): 2

Top Topics

Processing Times

Polynomially Solvable

Top Venues

Eur. J. Oper. Res.

Discret. Appl. Math.

Publications

Christos Koulamas, George Steiner
New results for scheduling to minimize tardiness on one machine with rejection and related problems. J. Sched. 24 (1) (2021)
Daniel Oron, Dvir Shabtay, George Steiner
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times. Eur. J. Oper. Res. 256 (2) (2017)
Daniel Oron, Dvir Shabtay, George Steiner
Single machine scheduling with two competing agents and equal job processing times. Eur. J. Oper. Res. 244 (1) (2015)
Sorina Dumitrescu, George Steiner, Rui Zhang
Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs. J. Sched. 18 (1) (2015)
Dvir Shabtay, George Steiner, Liron Yedidsion
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. Discret. Appl. Math. 182 (2015)
Xianyu Yu, Yulin Zhang, George Steiner
Single-machine scheduling with periodic maintenance to minimize makespan revisited. J. Sched. 17 (3) (2014)
Esaignani Selvarajah, George Steiner, Rui Zhang
Single machine batch scheduling with release times and delivery costs. J. Sched. 16 (1) (2013)
Jianbo Qian, George Steiner
Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine. Eur. J. Oper. Res. 225 (3) (2013)
George Steiner, Rui Zhang
Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties. Oper. Res. 59 (6) (2011)
George Steiner, Rui Zhang
Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries. Ann. Oper. Res. 191 (1) (2011)
Vladimir G. Deineko, Dvir Shabtay, George Steiner
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. J. Heuristics 17 (1) (2011)
Dvir Shabtay, George Steiner
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. J. Sched. 14 (5) (2011)
Yaron Leyvand, Dvir Shabtay, George Steiner
A unified approach for scheduling with convex resource consumption functions using positional penalties. Eur. J. Oper. Res. 206 (2) (2010)
Yaron Leyvand, Dvir Shabtay, George Steiner, Liron Yedidsion
Just-in-time scheduling with controllable processing times on parallel machines. J. Comb. Optim. 19 (3) (2010)
Moshe Dror, George Steiner
'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders. Discret. Appl. Math. 158 (16) (2010)
Dvir Shabtay, George Steiner, Liron Yedidsion
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments. Discret. Appl. Math. 158 (10) (2010)
George Steiner, Rui Zhang
Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains. J. Sched. 12 (6) (2009)
Daniel Oron, George Steiner, Vadim G. Timkovsky
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles. Discret. Optim. 6 (3) (2009)
Esaignani Selvarajah, George Steiner
Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs. Oper. Res. 57 (2) (2009)
Dvir Shabtay, George Steiner
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Ann. Oper. Res. 159 (1) (2008)
Dvir Shabtay, George Steiner
Optimal due date assignment in multi-machine scheduling environments. J. Sched. 11 (3) (2008)
Dvir Shabtay, George Steiner
A survey of scheduling with controllable processing times. Discret. Appl. Math. 155 (13) (2007)
Stavros G. Kolliopoulos, George Steiner
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective. Oper. Res. Lett. 35 (5) (2007)
Dvir Shabtay, George Steiner
Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine. Manuf. Serv. Oper. Manag. 9 (3) (2007)
Stavros G. Kolliopoulos, George Steiner
Partially ordered knapsack and applications to scheduling. Discret. Appl. Math. 155 (8) (2007)
George Steiner, Paul Stephenson
Pareto optima for total weighted completion time and maximum lateness on a single machine. Discret. Appl. Math. 155 (17) (2007)
Esaignani Selvarajah, George Steiner
Batch scheduling in a two-level supply chain - a focus on the supplier. Eur. J. Oper. Res. 173 (1) (2006)
Jianping Li, George Steiner
Partioning A Bipartite Graph into Vertex-Disjoint Paths. Ars Comb. 81 (2006)
George Steiner, Zhihui Xue
On the connection between a cyclic job shop and a reentrant flow shop scheduling problem. J. Sched. 9 (4) (2006)
Dvir Shabtay, George Steiner
Two due date assignment problems in scheduling a single machine. Oper. Res. Lett. 34 (6) (2006)
Stavros G. Kolliopoulos, George Steiner
Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theor. Comput. Sci. 355 (3) (2006)
George Steiner, Zhihui Xue
Scheduling in Reentrant Robotic Cells: Algorithms and Complexity. J. Sched. 8 (1) (2005)
George Steiner, Zhihui Xue
The maximum traveling salesman problem on van der Veen matrices. Discret. Appl. Math. 146 (1) (2005)
Vladimir G. Deineko, George Steiner, Zhihui Xue
Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 9 (4) (2005)
Stavros G. Kolliopoulos, George Steiner
On Minimizing the Total Weighted Tardiness on a Single Machine. STACS (2004)
George Steiner
On the k-path partition of graphs. Theor. Comput. Sci. 290 (3) (2003)
Stavros G. Kolliopoulos, George Steiner
Partially-Ordered Knapsack and Applications to Scheduling. ESA (2002)
Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner
Efficient algorithms on distributive lattices. Discret. Appl. Math. 110 (2-3) (2001)
Jinliang Cheng, George Steiner, Paul Stephenson
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. Eur. J. Oper. Res. 130 (3) (2001)
George Steiner, Paul Stephenson
Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems. SIAM J. Discret. Math. 13 (4) (2000)
Jitender S. Deogun, Dieter Kratsch, George Steiner
An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. Inf. Process. Lett. 61 (3) (1997)
Wieslaw Kubiak, George Steiner, Julian Scott Yeomans
Optimal level schedules for mixed-model, multi-level just-in-time assembly systems. Ann. Oper. Res. 69 (1997)
George Steiner
A poset-based method for counting partitions and Ferrers diagrams. Ars Comb. 47 (1997)
George Steiner
Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates. Discret. Appl. Math. 72 (1-2) (1997)
Jitender S. Deogun, Dieter Kratsch, George Steiner
1-Tough cocomparability graphs are hamiltonian. Discret. Math. 170 (1-3) (1997)
Michel Habib, Lhouari Nourine, George Steiner
Gray Codes for the Ideals of Interval Orders. J. Algorithms 25 (1) (1997)
Jiang Chen, George Steiner
Approximation methods for discrete lot streaming in flow shops. Oper. Res. Lett. 21 (3) (1997)
George Steiner
The recognition of indifference digraphs and generalized semiorders. J. Graph Theory 21 (2) (1996)
Jitender S. Deogun, George Steiner
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs. SIAM J. Comput. 23 (3) (1994)
George Steiner, Scott Yeomans
A Note on "Scheduling Unit-Time Tasks with Integer Release Times and Deadlines". Inf. Process. Lett. 47 (3) (1993)
Jitender S. Deogun, George Steiner
Hamiltonian Cycle is Polynomial on Cocomparability Graphs. Discret. Appl. Math. 39 (2) (1992)
Kevin Ewacha, Ivan Rival, George Steiner
Permutation Schedules for Flow Shops with Precedence Constraints. Oper. Res. 38 (6) (1990)
George Steiner
Minimizing bumps in ordered sets by substitution decomposition. Discret. Math. 76 (3) (1989)
George Steiner
Searching in 2-Dimensional Partial Orders. J. Algorithms 8 (1) (1987)
Jeffrey B. Sidney, George Steiner
Optimal Sequencing by Modular Decomposition: Polynomial Algorithms. Oper. Res. 34 (4) (1986)
George Steiner
A compact labeling scheme for series-parallel graphs. Discret. Appl. Math. 11 (3) (1985)
George Steiner
Single Machine Scheduling with Precedence Constraints of Dimension 2. Math. Oper. Res. 9 (2) (1984)
George Steiner
Mathematical aspects of scheduling and applications, by R. Bellman, A. O. Esogbue, and I. Nabeshima, Pergamon, London, 1982, 329 pp. Price: $19.50. Networks 14 (1) (1984)