George Steiner

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