George Steiner

According to our database1, George Steiner authored at least 57 papers between 1984 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




New results for scheduling to minimize tardiness on one machine with rejection and related problems.
J. Sched., 2021

Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times.
Eur. J. Oper. Res., 2017

Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs.
J. Sched., 2015

Single machine scheduling with two competing agents and equal job processing times.
Eur. J. Oper. Res., 2015

A pseudo-polynomial time algorithm for solving the resource dependent assignment problem.
Discret. Appl. Math., 2015

Single-machine scheduling with periodic maintenance to minimize makespan revisited.
J. Sched., 2014

Single machine batch scheduling with release times and delivery costs.
J. Sched., 2013

Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine.
Eur. J. Oper. Res., 2013

A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates.
J. Sched., 2011

Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties.
Oper. Res., 2011

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices.
J. Heuristics, 2011

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries.
Ann. Oper. Res., 2011

Just-in-time scheduling with controllable processing times on parallel machines.
J. Comb. Optim., 2010

A unified approach for scheduling with convex resource consumption functions using positional penalties.
Eur. J. Oper. Res., 2010

Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments.
Discret. Appl. Math., 2010

'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders.
Discret. Appl. Math., 2010

Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains.
J. Sched., 2009

Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs.
Oper. Res., 2009

The bipartite margin shop and maximum red matchings free of blue-red alternating cycles.
Discret. Optim., 2009

Optimal due date assignment in multi-machine scheduling environments.
J. Sched., 2008

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times.
Ann. Oper. Res., 2008

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective.
Oper. Res. Lett., 2007

Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine.
Manuf. Serv. Oper. Manag., 2007

Pareto optima for total weighted completion time and maximum lateness on a single machine.
Discret. Appl. Math., 2007

A survey of scheduling with controllable processing times.
Discret. Appl. Math., 2007

Partially ordered knapsack and applications to scheduling.
Discret. Appl. Math., 2007

Approximation algorithms for minimizing the total weighted tardiness on a single machine.
Theor. Comput. Sci., 2006

On the connection between a cyclic job shop and a reentrant flow shop scheduling problem.
J. Sched., 2006

Two due date assignment problems in scheduling a single machine.
Oper. Res. Lett., 2006

Batch scheduling in a two-level supply chain - a focus on the supplier.
Eur. J. Oper. Res., 2006

Partioning A Bipartite Graph into Vertex-Disjoint Paths.
Ars Comb., 2006

Scheduling in Reentrant Robotic Cells: Algorithms and Complexity.
J. Sched., 2005

Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices.
J. Comb. Optim., 2005

The maximum traveling salesman problem on van der Veen matrices.
Discret. Appl. Math., 2005

On Minimizing the Total Weighted Tardiness on a Single Machine.
Proceedings of the STACS 2004, 2004

On the k-path partition of graphs.
Theor. Comput. Sci., 2003

A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times.
Eur. J. Oper. Res., 2001

Efficient algorithms on distributive lattices.
Discret. Appl. Math., 2001

Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems.
SIAM J. Discret. Math., 2000

Approximation methods for discrete lot streaming in flow shops.
Oper. Res. Lett., 1997

Gray Codes for the Ideals of Interval Orders.
J. Algorithms, 1997

An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path.
Inf. Process. Lett., 1997

1-Tough cocomparability graphs are hamiltonian.
Discret. Math., 1997

Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates.
Discret. Appl. Math., 1997

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

Optimal level schedules for mixed-model, multi-level just-in-time assembly systems.
Ann. Oper. Res., 1997

The recognition of indifference digraphs and generalized semiorders.
J. Graph Theory, 1996

Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs.
SIAM J. Comput., 1994

A Note on "Scheduling Unit-Time Tasks with Integer Release Times and Deadlines".
Inf. Process. Lett., 1993

Hamiltonian Cycle is Polynomial on Cocomparability Graphs.
Discret. Appl. Math., 1992

Permutation Schedules for Flow Shops with Precedence Constraints.
Oper. Res., 1990

Minimizing bumps in ordered sets by substitution decomposition.
Discret. Math., 1989

Searching in 2-Dimensional Partial Orders.
J. Algorithms, 1987

Optimal Sequencing by Modular Decomposition: Polynomial Algorithms.
Oper. Res., 1986

A compact labeling scheme for series-parallel graphs.
Discret. Appl. Math., 1985

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

Single Machine Scheduling with Precedence Constraints of Dimension 2.
Math. Oper. Res., 1984