George Steiner

J. Sched., 2021

2017

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

[BibT_eX]

[DOI]

Daniel Oron

Eur. J. Oper. Res., 2017

2015

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

[BibT_eX]

[DOI]

Sorina Dumitrescu

J. Sched., 2015

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

[BibT_eX]

[DOI]

Daniel Oron

Eur. J. Oper. Res., 2015

A pseudo-polynomial time algorithm for solving the resource dependent assignment problem.

[BibT_eX]

[DOI]

Liron Yedidsion

Discret. Appl. Math., 2015

2014

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

[BibT_eX]

[DOI]

Xianyu Yu

Yulin Zhang

J. Sched., 2014

2013

Single machine batch scheduling with release times and delivery costs.

[BibT_eX]

[DOI]

Esaignani Selvarajah

J. Sched., 2013

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

[BibT_eX]

[DOI]

Jianbo Qian

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.

[BibT_eX]

[DOI]

J. Sched., 2011

Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties.

[BibT_eX]

[DOI]

Oper. Res., 2011

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

[BibT_eX]

[DOI]

Vladimir G. Deineko

J. Heuristics, 2011

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

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

2010

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

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

[BibT_eX]

[DOI]

Yaron Leyvand

Eur. J. Oper. Res., 2010

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

[BibT_eX]

[DOI]

Liron Yedidsion

Discret. Appl. Math., 2010

'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders.

[BibT_eX]

[DOI]

Moshe Dror

Discret. Appl. Math., 2010

2009

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

[BibT_eX]

[DOI]

J. Sched., 2009

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

[BibT_eX]

[DOI]

Esaignani Selvarajah

Oper. Res., 2009

The bipartite margin shop and maximum red matchings free of blue-red alternating cycles.

[BibT_eX]

[DOI]

Daniel Oron

Vadim G. Timkovsky

Discret. Optim., 2009

2008

Optimal due date assignment in multi-machine scheduling environments.

[BibT_eX]

[DOI]

J. Sched., 2008

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

[BibT_eX]

[DOI]

Ann. Oper. Res., 2008

2007

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

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

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

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2007

Pareto optima for total weighted completion time and maximum lateness on a single machine.

[BibT_eX]

[DOI]

Paul Stephenson

Discret. Appl. Math., 2007

A survey of scheduling with controllable processing times.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Partially ordered knapsack and applications to scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Approximation algorithms for minimizing the total weighted tardiness on a single machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

On the connection between a cyclic job shop and a reentrant flow shop scheduling problem.

[BibT_eX]

[DOI]

J. Sched., 2006

Two due date assignment problems in scheduling a single machine.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

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

[BibT_eX]

[DOI]

Esaignani Selvarajah

Eur. J. Oper. Res., 2006

Partioning A Bipartite Graph into Vertex-Disjoint Paths.

[BibT_eX]

Jianping Li

Ars Comb., 2006

2005

Scheduling in Reentrant Robotic Cells: Algorithms and Complexity.

[BibT_eX]

[DOI]

J. Sched., 2005

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

[BibT_eX]

[DOI]

Vladimir G. Deineko

J. Comb. Optim., 2005

The maximum traveling salesman problem on van der Veen matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

On Minimizing the Total Weighted Tardiness on a Single Machine.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

2003

On the k-path partition of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2001

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

[BibT_eX]

[DOI]

Jinliang Cheng

Paul Stephenson

Eur. J. Oper. Res., 2001

Efficient algorithms on distributive lattices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems.

[BibT_eX]

[DOI]

Paul Stephenson

SIAM J. Discret. Math., 2000

1997

Approximation methods for discrete lot streaming in flow shops.

[BibT_eX]

[DOI]

Jiang Chen

Oper. Res. Lett., 1997

Gray Codes for the Ideals of Interval Orders.

[BibT_eX]

[DOI]

Michel Habib

Lhouari Nourine

J. Algorithms, 1997

An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path.

[BibT_eX]

[DOI]

Dieter Kratsch

Inf. Process. Lett., 1997

1-Tough cocomparability graphs are hamiltonian.

[BibT_eX]

[DOI]

Dieter Kratsch

Discret. Math., 1997

Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

A poset-based method for counting partitions and Ferrers diagrams.

[BibT_eX]

Ars Comb., 1997

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

[BibT_eX]

[DOI]

Wieslaw Kubiak

Julian Scott Yeomans

Ann. Oper. Res., 1997

1996

The recognition of indifference digraphs and generalized semiorders.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

1994

Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

1993

A Note on "Scheduling Unit-Time Tasks with Integer Release Times and Deadlines".

[BibT_eX]

[DOI]

Scott Yeomans

Inf. Process. Lett., 1993

1992

Hamiltonian Cycle is Polynomial on Cocomparability Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1990

Permutation Schedules for Flow Shops with Precedence Constraints.

[BibT_eX]

[DOI]

Kevin Ewacha

Ivan Rival

Oper. Res., 1990

1989

Minimizing bumps in ordered sets by substitution decomposition.

[BibT_eX]

[DOI]

Discret. Math., 1989

1987

Searching in 2-Dimensional Partial Orders.

[BibT_eX]

[DOI]

J. Algorithms, 1987

1986

Optimal Sequencing by Modular Decomposition: Polynomial Algorithms.

[BibT_eX]

[DOI]

Jeffrey B. Sidney

Oper. Res., 1986

1985

A compact labeling scheme for series-parallel graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Networks, 1984

Single Machine Scheduling with Precedence Constraints of Dimension 2.

[BibT_eX]

[DOI]