Marc E. Posner

Ann. Oper. Res., 2021

2019

Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs.

[BibT_eX]

[DOI]

J. Sched., 2019

2015

Erratum to: Flow shops with WIP and value added costs.

[BibT_eX]

[DOI]

Jaehwan Yang

J. Sched., 2015

2011

A large class of facets for the <i>K</i>-median polytope.

[BibT_eX]

[DOI]

Wenhui Zhao

Math. Program., 2011

2010

Maximizing the Lifetime of a Barrier of Wireless Sensors.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2010

Flow shops with WIP and value added costs.

[BibT_eX]

[DOI]

Jaehwan Yang

J. Sched., 2010

The Generation of Experimental Data for Computational Testing in Optimization.

[BibT_eX]

[DOI]

Proceedings of the Experimental Methods for the Analysis of Optimization Algorithms., 2010

2009

Online Scheduling with Known Arrival Times.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

2007

Allocation of jobs and identical resources with two pooling centers.

[BibT_eX]

[DOI]

Hui-Chih Hung

Queueing Syst. Theory Appl., 2007

Polyhedral Properties of the <i>K</i> -median Problem on a Tree.

[BibT_eX]

[DOI]

Sven de Vries

Rakesh V. Vohra

Math. Program., 2007

Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures.

[BibT_eX]

[DOI]

Oper. Res., 2007

Optimal sleep-wakeup algorithms for barriers of wireless sensors.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Broadband Communications, 2007

2005

Scheduling Parallel Machines for the Customer Order Problem.

[BibT_eX]

[DOI]

Jaehwan Yang

J. Sched., 2005

2004

Sensitivity Analysis for Scheduling Problems.

[BibT_eX]

[DOI]

J. Sched., 2004

2001

Parallel machine scheduling with high multiplicity.

[BibT_eX]

[DOI]

John J. Clifford

Math. Program., 2001

Generating Experimental Data for Computational Testing with Machine Scheduling Applications.

[BibT_eX]

[DOI]

Oper. Res., 2001

2000

High Multiplicity in Earliness-Tardiness Scheduling.

[BibT_eX]

[DOI]

John J. Clifford

Oper. Res., 2000

1998

Scheduling with Finite Capacity Input Buffers.

[BibT_eX]

[DOI]

Oper. Res., 1998

Scheduling with Finite Capacity Output Buffers.

[BibT_eX]

[DOI]

Oper. Res., 1998

1997

Performance Measures and Schedules in Periodic Job Shops.

[BibT_eX]

[DOI]

Tae-Eog Lee

Oper. Res., 1997

Preemptive scheduling with finite capacity input buffers.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1997

1993

An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity.

[BibT_eX]

[DOI]

Lu Lu

Math. Oper. Res., 1993

1992

Scheduling with release dates on a single machine to minimize total weighted completion time.

[BibT_eX]

[DOI]

Hocine Belouadah

Discret. Appl. Math., 1992

1991

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date.

[BibT_eX]

[DOI]

Oper. Res., 1991

1988

The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic.

[BibT_eX]

[DOI]

Oper. Res., 1988

1987

A dual approach for the continuous collapsing knapsack problem.

[BibT_eX]

[DOI]

Hisatoshi Suzuki

Math. Program., 1987

1985

The Caterer Problem.

[BibT_eX]

[DOI]

Wlodzimierz Szwarc

Oper. Res., 1985

Minimizing Weighted Completion Times with Deadlines.

[BibT_eX]

[DOI]

Oper. Res., 1985

1983

The continuous collapsing Knapsack problem.

[BibT_eX]

[DOI]

Math. Program., 1983

1981

Linear max-min programming.

[BibT_eX]

[DOI]

Chu-Tao Wu

Math. Program., 1981

1978

The Collapsing 0-1 Knapsack Problem.

[BibT_eX]

[DOI]

Monique Guignard

Math. Program., 1978

The decomposition of nonlinear problems.

[BibT_eX]

[DOI]