# Jonathan F. Bard

According to our database

Collaborative distances:

^{1}, Jonathan F. Bard authored at least 78 papers between 1977 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers.

J. Sched., 2020

2019

A performance analysis of dispatch rules for semiconductor assembly & test operations.

J. Simulation, 2019

An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation.

Eur. J. Oper. Res., 2019

Comput. Oper. Res., 2019

2018

Proceedings of the 2018 Winter Simulation Conference, 2018

2016

The Destination-Loader-Door Assignment Problem for Automated Package Sorting Centers.

Transp. Sci., 2016

J. Oper. Res. Soc., 2016

Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles.

Eur. J. Oper. Res., 2016

2015

A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity.

Transp. Sci., 2015

Improving performance of dispatch rules for daily scheduling of assembly and test operations.

Comput. Ind. Eng., 2015

Optimization of multi-fleet aircraft routing considering passenger transiting under airline disruption.

Comput. Ind. Eng., 2015

2014

J. Sched., 2014

2013

Flexible weekly tour scheduling for postal service workers using a branch and price.

J. Sched., 2013

INFORMS Trans. Educ., 2013

A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines.

Ann. Oper. Res., 2013

A simulation analysis of a patient-centered surgical home to improve outpatient surgical processes of care and outcomes.

Proceedings of the Winter Simulations Conference: Simulation Making Decisions in a Complex World, 2013

2012

A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment.

Comput. Oper. Res., 2012

Comput. Oper. Res., 2012

2011

J. Oper. Res. Soc., 2011

J. Heuristics, 2011

2010

Eur. J. Oper. Res., 2010

A branch-and-price algorithm for an integrated production and inventory routing problem.

Comput. Oper. Res., 2010

2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

J. Sched., 2009

Comput. Ind. Eng., 2009

2008

Manuf. Serv. Oper. Manag., 2008

A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs.

Eur. J. Oper. Res., 2008

2007

A two-stage stochastic programming approach for project planning with uncertain activity durations.

J. Sched., 2007

J. Sched., 2007

J. Oper. Res. Soc., 2007

Workforce planning at USPS mail processing and distribution centers using stochastic optimization.

Ann. Oper. Res., 2007

2006

J. Sched., 2006

A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem.

INFORMS J. Comput., 2006

Eur. J. Oper. Res., 2006

Comput. Oper. Res., 2006

Generating labor requirements and rosters for mail handlers using simulation and optimization.

Comput. Oper. Res., 2006

2005

J. Oper. Res. Soc., 2005

INFORMS J. Comput., 2005

Eur. J. Oper. Res., 2005

2004

Oper. Res., 2004

Comput. Ind. Eng., 2004

2003

A Bundle Algorithm Approach for the Aircraft Schedule Recovery Problem During Hub Closures.

Transp. Sci., 2003

Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system.

J. Oper. Res. Soc., 2003

J. Comb. Optim., 2003

Comput. Oper. Res., 2003

2002

Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework.

Transp. Sci., 2002

Transp. Sci., 2002

Discret. Appl. Math., 2002

2000

Interfaces, 2000

Eur. J. Oper. Res., 2000

1999

An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times.

J. Heuristics, 1999

1998

A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities.

Transp. Sci., 1998

Eur. J. Oper. Res., 1998

Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.

Comput. Oper. Res., 1998

1997

J. Comb. Optim., 1997

1995

Oper. Res., 1995

INFORMS J. Comput., 1995

1993

J. Glob. Optim., 1993

1992

Recent developments in screening methods for nondominated solutions in multiobjective optimization.

Comput. Oper. Res., 1992

Ann. Oper. Res., 1992

1991

IEEE Trans. Syst. Man Cybern., 1991

A GRASP<sup>TM</sup> for a difficult single machine scheduling problem<sup>, </sup>.

Comput. Oper. Res., 1991

1990

SIAM J. Sci. Comput., 1990

Oper. Res., 1990

1989

Comput. Oper. Res., 1989

1988

Math. Program., 1988

Oper. Res., 1988

1985

IEEE Trans. Syst. Man Cybern., 1985

Objective function bounds for the inexact linear programming problem with generalized cost coefficients.

Comput. Oper. Res., 1985

1984

IEEE Trans. Syst. Man Cybern., 1984

1983

Math. Oper. Res., 1983

Oper. Res., 1983

1982

Comput. Oper. Res., 1982

Comput. Oper. Res., 1982

1981

Proceedings of the 13th conference on Winter simulation, 1981

1977

Proceedings of the 9th conference on Winter simulation, 1977