G. Steiner

发表

Level Schedules for Mixed-Model, Just-in-Time Processes

G. Steiner, S. Yeomans, 1993 .

One‐facility location with rectilinear tour distances

G. O. Wesolowsky, Z. Drezner, G. Steiner, 1985 .

BATCH SCHEDULING TO MINIMIZE CYCLE TIME, FLOW TIME, AND PROCESSING COST

G. Steiner, W. Truscott, 1993 .

Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging

G. Steiner, J. Yeomans, 1996 .

Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm

D. Kratsch, G. Steiner, J. Deogun, 1991 .

The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times

G. Steiner, Moshe Kaspi, D. Shabtay, 2007 .

An algorithm to generate the ideals of a partial order

George Steiner, G. Steiner, 1986 .

Computing the bump number is easy

Rolf H. Möhring, Michel Habib, George Steiner, 1988 .

A linear time algorithm for maximum matchings in convex, bipartite graphs☆

Julian Scott Yeomans, George Steiner, G. Steiner, 1996 .

A bicriterion objective for levelling the schedule of a mixed-model, JIT assembly process

George Steiner, G. Steiner, S. Yeomans, 1994 .

A decomposition approach for finding the setup number of a partial order

G. Steiner, 1984 .

On estimating the number of order ideals in partial orders, with some applications

George Steiner, G. Steiner, 1993 .

Finding the largest suborder of fixed width

G. Steiner, 1992 .

An algorithm for minimizing setups in precedence constrained scheduling

G. Steiner, 1985 .

BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS

G. Steiner, Esaignani Selvarajah, 2006 .

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, G. Steiner, 1984, Networks.

Shop scheduling in manufacturing systems: algorithms and complexity

G. Steiner, Zhihui Xue, 2004 .

'Strong'-'Weak' Precedence in Scheduling: Extended Order Implications

M. Dror, G. Steiner, 2009 .

Discrete Lot Strea 1 ning in Three-Machine Flow Shops *

G. Steiner, Jiang Chen, 2013 .

Single machine batch scheduling with release times and delivery costs

Rui Zhang, G. Steiner, Esaignani Selvarajah, 2011, Journal of Scheduling.

Lot Strea 1 ning with Attached Setups in Three-Machine Flow Shops *

G. Steiner, Jiang Chen, 2013 .

An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path

Jitender S. Deogun, Dieter Kratsch, George Steiner, 1997, Inf. Process. Lett..

On a decomposition algorithm for sequencing problems with precedence constraints

George Steiner, G. Steiner, 1983 .

Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times

Dvir Shabtay, George Steiner, Yaron Leyvand, 2009 .

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

Dvir Shabtay, George Steiner, G. Steiner, 2008, Ann. Oper. Res..

A survey of scheduling with controllable processing times

Dvir Shabtay, George Steiner, G. Steiner, 2007, Discret. Appl. Math..

Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine

Dvir Shabtay, George Steiner, G. Steiner, 2007, Manuf. Serv. Oper. Manag..

Two due date assignment problems in scheduling a single machine

Dvir Shabtay, George Steiner, G. Steiner, 2006, Oper. Res. Lett..

Lot streaming with attached setups in three-machine flow shops

Jiang Chen, George Steiner, G. Steiner, 1997 .

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

Christos Koulamas, George Steiner, G. Steiner, 2020, J. Sched..

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

G. Steiner, Christos Koulamas, 2020, Journal of Scheduling.

Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties

Rui Zhang, George Steiner, Rui Zhang, 2011, Oper. Res..

The connection between the bump number problem and flow-shop scheduling with precedence constraints

George Steiner, G. Steiner, 1990 .

Just-in-time scheduling with controllable processing times on parallel machines

Dvir Shabtay, George Steiner, Liron Yedidsion, 2010, J. Comb. Optim..

Single machine batch scheduling with release times and delivery costs

Rui Zhang, George Steiner, Esaignani Selvarajah, 2011, Journal of Scheduling.

Single machine scheduling with two competing agents and equal job processing times

Dvir Shabtay, Daniel Oron, George Steiner, 2015, Eur. J. Oper. Res..

Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs

Rui Zhang, Sorina Dumitrescu, George Steiner, 2014, Journal of Scheduling.

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries

Rui Zhang, George Steiner, G. Steiner, 2011, Ann. Oper. Res..

Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains

Rui Zhang, George Steiner, Rui Zhang, 2009, J. Sched..

Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs

George Steiner, Esaignani Selvarajah, G. Steiner, 2009, Oper. Res..

BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS( Advanced Planning and Scheduling for Supply Chain Management)

George Steiner, Esaignani Selvarajah, G. Steiner, 2006 .

Batch scheduling in a two-level supply chain - a focus on the supplier

George Steiner, Esaignani Selvarajah, G. Steiner, 2006, Eur. J. Oper. Res..

Partitioning a graph into vertex-disjoint paths

G. Steiner, Jianping Li, 2005 .

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

Dvir Shabtay, Daniel Oron, George Steiner, 2017, Eur. J. Oper. Res..

Optimal coordination of resource allocation, due date assignment and scheduling decisions

Dvir Shabtay, Rui Zhang, George Steiner, 2016 .

Partially ordered knapsack and applications to scheduling

Stavros G. Kolliopoulos, George Steiner, G. Steiner, 2007, Discret. Appl. Math..

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

Stavros G. Kolliopoulos, George Steiner, G. Steiner, 2007, Oper. Res. Lett..

Partially-Ordered Knapsack and Applications to Scheduling

Stavros G. Kolliopoulos, George Steiner, G. Steiner, 2002, ESA.

On the k-path partition of graphs

George Steiner, G. Steiner, 2003, Theor. Comput. Sci..

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices

Dvir Shabtay, George Steiner, Vladimir G. Deineko, 2011, J. Heuristics.

Gray Codes for the Ideals of Interval Orders

Lhouari Nourine, Michel Habib, George Steiner, 1997, J. Algorithms.

A compact labeling scheme for series-parallel graphs

George Steiner, G. Steiner, 1985, Discret. Appl. Math..

On the complexity of dynamic programming for sequencing problems with precedence constraints

George Steiner, G. Steiner, 1991 .

A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems

George Steiner, J. Miltenburg, Scott Yeomans, 1990 .

Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems

Paul Stephenson, George Steiner, G. Steiner, 2000, SIAM J. Discret. Math..

A fast algorithm to minimize maximum lateness for the two-machine flow-shop problem

Paul Stephenson, George Steiner, Jinliang Cheng, 1999 .

Fast algorithms to minimize the makespan or maximum lateness in the two‐machine flow shop with release times

Paul Stephenson, George Steiner, Jinliang Cheng, 2002 .

Optimal Sequencing by Modular Decomposition: Polynomial Algorithms

George Steiner, Jeffrey B. Sidney, G. Steiner, 1986, Oper. Res..

A unified approach for scheduling with convex resource consumption functions using positional penalties

Dvir Shabtay, George Steiner, Yaron Leyvand, 2010, Eur. J. Oper. Res..

Sequencing jobs on a single machine with a common due date and stochastic processing times

Subhash C. Sarin, George Steiner, Erdal Erel, 1991 .

Optimal level schedules for mixed-model, multi-level just-in-time assembly systems

Wieslaw Kubiak, Julian Scott Yeomans, George Steiner, 1997, Ann. Oper. Res..

Single-machine scheduling with periodic maintenance to minimize makespan revisited

George Steiner, Yulin Zhang, Xianyu Yu, 2013, Journal of Scheduling.

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, G. Steiner, 2011, J. Sched..

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries

G. Steiner, Rui Zhang, 2011, Ann. Oper. Res..

Single machine batch scheduling to minimize total completion time and resource consumption costs

Dvir Shabtay, George Steiner, G. Steiner, 2007 .

Scheduling in Reentrant Robotic Cells: Algorithms and Complexity

George Steiner, Zhihui Xue, G. Steiner, 2005, J. Sched..

Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey

Dvir Shabtay, George Steiner, G. Steiner, 2012 .

A fast algorithm to minimize makespan for the two-machine flow-shop problem with release times

George Steiner, Jinliang Cheng, Paul Stephenson, 1999 .

Efficient algorithms on distributive lattices

Lhouari Nourine, Michel Habib, Raoul Medina, 2001, Discret. Appl. Math..

Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine

George Steiner, Jianbo Qian, G. Steiner, 2013 .

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

George Steiner, Jianbo Qian, G. Steiner, 2013, Eur. J. Oper. Res..

Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Dvir Shabtay, Liron Yedidsion, George Steiner, 2010, Discret. Appl. Math..

A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders

George Steiner, Lorna Stewart, G. Steiner, 1987 .

Single Machine Scheduling with Precedence Constraints of Dimension 2

George Steiner, G. Steiner, 1984, Math. Oper. Res..

Sequencing on single machine with general precedence constraints: the job module algorithm

George Steiner, G. Steiner, 1983 .