Criminal justice dynamics: A planning model. - Jonathan F. Bard (WSC, 1977)

An engagement effectiveness model for surface ships. - Jonathan F. Bard (WSC, 1981)

An explicit solution to the multi-level programming problem. - Jonathan F. Bard; James E. Falk (Comput. Oper. Res., 1982)

A separable programming approach to the linear complementarity problem. - Jonathan F. Bard; James E. Falk (Comput. Oper. Res., 1982)

An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem. - Jonathan F. Bard (Oper. Res., 1983)

An Algorithm for Solving the General Bilevel Programming Problem. - Jonathan F. Bard (Math. Oper. Res., 1983)

An investigation of the linear three level programming problem. - Jonathan F. Bard (IEEE Trans. Syst. Man Cybern., 1984)

Objective function bounds for the inexact linear programming problem with generalized cost coefficients. - Jonathan F. Bard; Sangit Chatterjee (Comput. Oper. Res., 1985)

A comparison of Box-Jenkins time series models with autoregressive processes. - Sangit Chatterjee; Jonathan F. Bard (IEEE Trans. Syst. Man Cybern., 1985)

Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation. - Jonathan F. Bard (Oper. Res., 1988)

Convex two-level optimization. - Jonathan F. Bard (Math. Program., 1988)

Probabilistic shortest path problems with budgetary constraints. - Jonathan F. Bard; Jeanne L. Miller (Comput. Oper. Res., 1989)

The Mixed Integer Linear Bilevel Programming Problem. - James T. Moore; Jonathan F. Bard (Oper. Res., 1990)

A Branch and Bound Algorithm for the Bilevel Programming Problem. - Jonathan F. Bard; James T. Moore (SIAM J. Sci. Comput., 1990)

A GRASPTM for a difficult single machine scheduling problem, . - Thomas A. Feo; Krishnamurthi Venkatraman; Jonathan F. Bard (Comput. Oper. Res., 1991)

Algorithms for nonlinear bilevel mathematical programs. - Thomas A. Edmunds; Jonathan F. Bard (IEEE Trans. Syst. Man Cybern., 1991)

An algorithm for the mixed-integer nonlinear bilevel programming problem. - Thomas A. Edmunds; Jonathan F. Bard (Ann. Oper. Res., 1992)

Recent developments in screening methods for nondominated solutions in multiobjective optimization. - Samuel B. Graves; Jeffrey L. Ringuest; Jonathan F. Bard (Comput. Oper. Res., 1992)

Single machine scheduling with flow time and earliness penalties. - Jonathan F. Bard; Krishnamurthi Venkatraman; Thomas A. Feo (J. Glob. Optim., 1993)

A GRASP for the Vehicle Routing Problem with Time Windows. - George Kontoravdis; Jonathan F. Bard (INFORMS J. Comput., 1995)

Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly. - Thomas A. Feo; Jonathan F. Bard; Scott D. Holland (Oper. Res., 1995)

Heuristic Scheduling Systems with Applications to Production Systems and Project Management [Book Reviews]. - Jonathan F. Bard (Proc. IEEE, 1996)

A Grasp for Aircraft Routing in Response to Groundings and Delays. - Michael F. Argüello; Jonathan F. Bard; Gang Yu 001 (J. Comb. Optim., 1997)

Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. - Roger Z. Ríos-Mercado; Jonathan F. Bard (Comput. Oper. Res., 1998)

Heuristics for the flow line problem with setup costs. - Roger Z. Ríos-Mercado; Jonathan F. Bard (Eur. J. Oper. Res., 1998)

A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities. - Jonathan F. Bard; Liu Huang; Patrick Jaillet; Moshe Dror (Transp. Sci., 1998)

An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times. - Roger Z. Ríos-Mercado; Jonathan F. Bard (J. Heuristics, 1999)

A bilevel programming approach to determining tax credits for biofuel production. - Jonathan F. Bard; John Plummer; Jean Claude Sourie (Eur. J. Oper. Res., 2000)

Book Reviews. - Benjamin Lev; János D. Pintér; Mark Kaiser; Jonathan F. Bard; Francis D. Tuggle; Ken R. McNaught; Lilian L. Barros; Antanas Zilinskas (Interfaces, 2000)

Single machine scheduling with assignable due dates. - Xiangtong Qi; Gang Yu 001; Jonathan F. Bard (Discret. Appl. Math., 2002)

A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows. - Jonathan F. Bard; George Kontoravdis; Gang Yu 001 (Transp. Sci., 2002)

Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework. - Patrick Jaillet; Jonathan F. Bard; Liu Huang; Moshe Dror (Transp. Sci., 2002)

Staff scheduling at the United States Postal Service. - Jonathan F. Bard; Canan Binici; Anura H. deSilva (Comput. Oper. Res., 2003)

The Flow Shop Scheduling Polyhedron with Setup Time. - Roger Z. Ríos-Mercado; Jonathan F. Bard (J. Comb. Optim., 2003)

Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system. - Siwate Rojanasoonthon; Jonathan F. Bard; S. D. Reddy (J. Oper. Res. Soc., 2003)

A Bundle Algorithm Approach for the Aircraft Schedule Recovery Problem During Hub Closures. - Benjamin G. Thengvall; Jonathan F. Bard; Gang Yu 001 (Transp. Sci., 2003)

Selecting the appropriate input data set when configuring a permanent workforce. - Jonathan F. Bard (Comput. Ind. Eng., 2004)

Class Scheduling for Pilot Training. - Xiangtong Qi; Jonathan F. Bard; Gang Yu 001 (Oper. Res., 2004)

Preference scheduling for nurses using column generation. - Jonathan F. Bard; Hadi W. Purnomo (Eur. J. Oper. Res., 2005)

A GRASP for Parallel Machine Scheduling with Time Windows. - Siwate Rojanasoonthon; Jonathan F. Bard (INFORMS J. Comput., 2005)

Disruption management for resource-constrained project scheduling. - G. Zhu; Jonathan F. Bard; G. Yu (J. Oper. Res. Soc., 2005)

Generating labor requirements and rosters for mail handlers using simulation and optimization. - Xiangtong Qi; Jonathan F. Bard (Comput. Oper. Res., 2006)

Comparative approaches to equipment scheduling in high volume factories. - Xinhui Zhang; Jonathan F. Bard (Comput. Oper. Res., 2006)

A multi-period machine assignment problem. - Xinhui Zhang; Jonathan F. Bard (Eur. J. Oper. Res., 2006)

A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem. - Guidong Zhu; Jonathan F. Bard; Gang Yu 001 (INFORMS J. Comput., 2006)

The task assignment problem for unrestricted movement between workstation groups. - Jonathan F. Bard; Lin Wan (J. Sched., 2006)

Workforce planning at USPS mail processing and distribution centers using stochastic optimization. - Jonathan F. Bard; David P. Morton; Yong Min Wang (Ann. Oper. Res., 2007)

Weekly staff scheduling with workstation group restrictions. - L. Wan; Jonathan F. Bard (J. Oper. Res. Soc., 2007)

Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. - Jonathan F. Bard; Hadi W. Purnomo (J. Sched., 2007)

A two-stage stochastic programming approach for project planning with uncertain activity durations. - Guidong Zhu; Jonathan F. Bard; Gang Yu 001 (J. Sched., 2007)

A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs. - Susan K. Monkman; Douglas J. Morrice; Jonathan F. Bard (Eur. J. Oper. Res., 2008)

Workforce Design with Movement Restrictions Between Workstation Groups. - Jonathan F. Bard; Lin Wan (Manuf. Serv. Oper. Manag., 2008)

Heuristics for a multiperiod inventory routing problem with production decisions. - Jonathan F. Bard; Narameth Nananukul (Comput. Ind. Eng., 2009)

The integrated production-inventory-distribution-routing problem. - Jonathan F. Bard; Narameth Nananukul (J. Sched., 2009)

Bilevel Linear Programming. - Jonathan F. Bard (Encyclopedia of Optimization, 2009)

Bilevel Linear Programming: Complexity, Equivalence to Minmax, Concave Programs. - Jonathan F. Bard (Encyclopedia of Optimization, 2009)

Bilevel Programming in Management. - Jonathan F. Bard (Encyclopedia of Optimization, 2009)

A branch-and-price algorithm for an integrated production and inventory routing problem. - Jonathan F. Bard; Narameth Nananukul (Comput. Oper. Res., 2010)

Validating vehicle routing zone construction using Monte Carlo simulation. - Jonathan F. Bard; Ahmad I. Jarrah; Jing Zan (Eur. J. Oper. Res., 2010)

A reactive GRASP with path relinking for capacitated clustering. - Yumin Deng; Jonathan F. Bard (J. Heuristics, 2011)

Pickup and delivery network segmentation using contiguous geographic clustering. - Ahmad I. Jarrah; Jonathan F. Bard (J. Oper. Res. Soc., 2011)

Large-scale pickup and delivery work area design. - Ahmad I. Jarrah; Jonathan F. Bard (Comput. Oper. Res., 2012)

A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. - Yuan Qu; Jonathan F. Bard (Comput. Oper. Res., 2012)

A simulation analysis of a patient-centered surgical home to improve outpatient surgical processes of care and outcomes. - Douglas J. Morrice; Dongyang Ester Wang; Jonathan F. Bard; Luci K. Leykum; Susan Noorily; Poornachand Veerapaneni (WSC, 2013)

A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines. - Susan K. Heath; Jonathan F. Bard; Douglas J. Morrice (Ann. Oper. Res., 2013)

Special Issue Dedicated to the Memory of Paul A. Jensen. - David P. Morton; Jonathan F. Bard (INFORMS Trans. Educ., 2013)

Flexible weekly tour scheduling for postal service workers using a branch and price. - Jens O. Brunner; Jonathan F. Bard (J. Sched., 2013)

A sequential GRASP for the therapist routing and scheduling problem. - Jonathan F. Bard; Yufen Shao; Ahmad I. Jarrah (J. Sched., 2014)

Optimization of multi-fleet aircraft routing considering passenger transiting under airline disruption. - Yuzhen Hu; Baoguang Xu; Jonathan F. Bard; Hong Chi; Mingang Gao (Comput. Ind. Eng., 2015)

Improving performance of dispatch rules for daily scheduling of assembly and test operations. - Shihui Jia; Jonathan F. Bard; Rodolfo Chacon; John Stuber (Comput. Ind. Eng., 2015)

A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity. - Yuan Qu; Jonathan F. Bard (Transp. Sci., 2015)

Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles. - Sifeng Lin; Gino J. Lim; Jonathan F. Bard (Eur. J. Oper. Res., 2016)

Annual block scheduling for internal medicine residents with 4+1 templates. - Jonathan F. Bard; Zhichao Shu; Douglas J. Morrice; Luci K. Leykum (J. Oper. Res. Soc., 2016)

The Destination-Loader-Door Assignment Problem for Automated Package Sorting Centers. - Ahmad I. Jarrah; Xiangtong Qi; Jonathan F. Bard (Transp. Sci., 2016)

Controlling work in process during semiconductor assembly and test operations. - Chuwen Zhang; Jonathan F. Bard; Rodolfo Chacon (Int. J. Prod. Res., 2017)

Using simulation to Design a Worklife Integrated Practice Unit. - Douglas J. Morrice; Jonathan F. Bard; Harshit Mehta; Swarup Sahoo; Natesh B. Arunachalam; Prashanth Venkatraman (WSC, 2018)

A stochastic optimization approach to shift scheduling with breaks adjustments. - Youngbum Hur; Jonathan F. Bard; Markus M. Frey; Ferdinand Kiermaier (Comput. Oper. Res., 2019)

An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation. - Roger Z. Ríos-Mercado; Jonathan F. Bard (Eur. J. Oper. Res., 2019)

Extended open shop scheduling with resource constraints: Appointment scheduling for integrated practice units. - Pengfei Zhang; Jonathan F. Bard; Douglas J. Morrice; Karl M. Koenig (IISE Trans., 2019)

Hierarchy machine set-up for multi-pass lot scheduling at semiconductor assembly and test facilities. - Youngbum Hur; Jonathan F. Bard; Rodolfo Chacon (Int. J. Prod. Res., 2019)

A performance analysis of dispatch rules for semiconductor assembly & test operations. - Shihui Jia; Douglas J. Morrice; Jonathan F. Bard (J. Simulation, 2019)

The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers. - Ferdinand Kiermaier; Markus Frey; Jonathan F. Bard (J. Sched., 2020)

Incorporating learning-by-doing into mixed complementarity equilibrium models. - Baturay Çalci; Benjamin D. Leibowicz; Jonathan F. Bard; Gopika G. Jayadev (Comput. Ind. Eng., 2021)

Risk-averse stochastic bilevel programming: An application to natural gas markets. - Gopika G. Jayadev; Benjamin D. Leibowicz; Jonathan F. Bard; Baturay Çalci (Comput. Ind. Eng., 2022)

A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime. - Jia Guo; Jonathan F. Bard (Comput. Oper. Res., 2022)

Strategic interactions between liquefied natural gas and domestic gas markets: A bilevel model. - Gopika G. Jayadev; Benjamin D. Leibowicz; Jonathan F. Bard; Baturay Çalci (Comput. Oper. Res., 2022)

Workforce capacity planning with hierarchical skills, long-term training, and random resignations. - Christian Ruf; Jonathan F. Bard; Rainer Kolisch (Int. J. Prod. Res., 2022)

Air traffic controller scheduling. - Jia Guo; Jonathan F. Bard (Comput. Ind. Eng., 2024)

Batch scheduling in a multi-purpose system with machine downtime and a multi-skilled workforce. - Ai Zhao; Jonathan F. Bard (Int. J. Prod. Res., 2024)

Optimal investment planning for production networks with fixed production profiles. - Donghao Liu; Benjamin D. Leibowicz; Jonathan F. Bard; Yuzixuan Zhu; Yuanyuan Guo; Yufen Shao (Comput. Oper. Res., 2025)

Weekly crew scheduling for freight rail engineers: A network approach. - Jinhua Lyu; Jonathan F. Bard (J. Rail Transp. Plan. Manag., 2025)