# George Steiner

According to our database

Collaborative distances:

^{1}, George Steiner authored at least 57 papers between 1984 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

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

J. Sched., 2021

2017

Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times.

Eur. J. Oper. Res., 2017

2015

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

2014

Single-machine scheduling with periodic maintenance to minimize makespan revisited.

J. Sched., 2014

2013

J. Sched., 2013

Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine.

Eur. J. Oper. Res., 2013

2011

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

J. Sched., 2011

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

2010

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

Discret. Appl. Math., 2010

2009

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

2008

J. Sched., 2008

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times.

Ann. Oper. Res., 2008

2007

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

Discret. Appl. Math., 2007

Discret. Appl. Math., 2007

2006

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

Oper. Res. Lett., 2006

Eur. J. Oper. Res., 2006

Partioning A Bipartite Graph into Vertex-Disjoint Paths.

Ars Comb., 2006

2005

J. Sched., 2005

Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices.

J. Comb. Optim., 2005

Discret. Appl. Math., 2005

2004

Proceedings of the STACS 2004, 2004

2003

Theor. Comput. Sci., 2003

2001

A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times.

Eur. J. Oper. Res., 2001

Discret. Appl. Math., 2001

2000

SIAM J. Discret. Math., 2000

1997

Oper. Res. Lett., 1997

J. Algorithms, 1997

Inf. Process. Lett., 1997

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

1996

J. Graph Theory, 1996

1994

SIAM J. Comput., 1994

1993

Inf. Process. Lett., 1993

1992

Discret. Appl. Math., 1992

1990

Oper. Res., 1990

1989

Discret. Math., 1989

1987

J. Algorithms, 1987

1986

Oper. Res., 1986

1985

Discret. Appl. Math., 1985

1984

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

Math. Oper. Res., 1984