Jonathan F. Bard

Publication Activity (10 Years)

Years Active: 1977-2024
Publications (10 Years): 18

Top Topics

Bilevel Programming

Open Shop Scheduling

Earliness Tardiness

Top Venues

Comput. Ind. Eng.

Int. J. Prod. Res.

Comput. Oper. Res.

Publications

Jia Guo, Jonathan F. Bard
Air traffic controller scheduling. Comput. Ind. Eng. 191 (2024)
Ai Zhao, Jonathan F. Bard
Batch scheduling in a multi-purpose system with machine downtime and a multi-skilled workforce. Int. J. Prod. Res. 62 (12) (2024)
Jia Guo, Jonathan F. Bard
A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime. Comput. Oper. Res. 138 (2022)
Christian Ruf, Jonathan F. Bard, Rainer Kolisch
Workforce capacity planning with hierarchical skills, long-term training, and random resignations. Int. J. Prod. Res. 60 (2) (2022)
Gopika G. Jayadev, Benjamin D. Leibowicz, Jonathan F. Bard, Baturay Çalci
Strategic interactions between liquefied natural gas and domestic gas markets: A bilevel model. Comput. Oper. Res. 144 (2022)
Gopika G. Jayadev, Benjamin D. Leibowicz, Jonathan F. Bard, Baturay Çalci
Risk-averse stochastic bilevel programming: An application to natural gas markets. Comput. Ind. Eng. 169 (2022)
Baturay Çalci, Benjamin D. Leibowicz, Jonathan F. Bard, Gopika G. Jayadev
Incorporating learning-by-doing into mixed complementarity equilibrium models. Comput. Ind. Eng. 159 (2021)
Ferdinand Kiermaier, Markus Frey, Jonathan F. Bard
The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers. J. Sched. 23 (2) (2020)
Pengfei Zhang, Jonathan F. Bard, Douglas J. Morrice, Karl M. Koenig
Extended open shop scheduling with resource constraints: Appointment scheduling for integrated practice units. IISE Trans. 51 (10) (2019)
Roger Z. Ríos-Mercado, Jonathan F. Bard
An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation. Eur. J. Oper. Res. 276 (1) (2019)
Youngbum Hur, Jonathan F. Bard, Markus M. Frey, Ferdinand Kiermaier
A stochastic optimization approach to shift scheduling with breaks adjustments. Comput. Oper. Res. 107 (2019)
Youngbum Hur, Jonathan F. Bard, Rodolfo Chacon
Hierarchy machine set-up for multi-pass lot scheduling at semiconductor assembly and test facilities. Int. J. Prod. Res. 57 (14) (2019)
Shihui Jia, Douglas J. Morrice, Jonathan F. Bard
A performance analysis of dispatch rules for semiconductor assembly & test operations. J. Simulation 13 (3) (2019)
Douglas J. Morrice, Jonathan F. Bard, Harshit Mehta, Swarup Sahoo, Natesh B. Arunachalam, Prashanth Venkatraman
Using simulation to Design a Worklife Integrated Practice Unit. WSC (2018)
Chuwen Zhang, Jonathan F. Bard, Rodolfo Chacon
Controlling work in process during semiconductor assembly and test operations. Int. J. Prod. Res. 55 (24) (2017)
Ahmad I. Jarrah, Xiangtong Qi, Jonathan F. Bard
The Destination-Loader-Door Assignment Problem for Automated Package Sorting Centers. Transp. Sci. 50 (4) (2016)
Jonathan F. Bard, Zhichao Shu, Douglas J. Morrice, Luci K. Leykum
Annual block scheduling for internal medicine residents with 4+1 templates. J. Oper. Res. Soc. 67 (7) (2016)
Sifeng Lin, Gino J. Lim, Jonathan F. Bard
Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles. Eur. J. Oper. Res. 251 (3) (2016)
Shihui Jia, Jonathan F. Bard, Rodolfo Chacon, John Stuber
Improving performance of dispatch rules for daily scheduling of assembly and test operations. Comput. Ind. Eng. 90 (2015)
Yuzhen Hu, Baoguang Xu, Jonathan F. Bard, Hong Chi, Mingang Gao
Optimization of multi-fleet aircraft routing considering passenger transiting under airline disruption. Comput. Ind. Eng. 80 (2015)
Yuan Qu, Jonathan F. Bard
A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity. Transp. Sci. 49 (2) (2015)
Jonathan F. Bard, Yufen Shao, Ahmad I. Jarrah
A sequential GRASP for the therapist routing and scheduling problem. J. Sched. 17 (2) (2014)
Douglas J. Morrice, Dongyang Ester Wang, Jonathan F. Bard, Luci K. Leykum, Susan Noorily, Poornachand Veerapaneni
A simulation analysis of a patient-centered surgical home to improve outpatient surgical processes of care and outcomes. WSC (2013)
David P. Morton, Jonathan F. Bard
Special Issue Dedicated to the Memory of Paul A. Jensen. INFORMS Trans. Educ. 14 (1) (2013)
Jens O. Brunner, Jonathan F. Bard
Flexible weekly tour scheduling for postal service workers using a branch and price. J. Sched. 16 (1) (2013)
Susan K. Heath, Jonathan F. Bard, Douglas J. Morrice
A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines. Ann. Oper. Res. 203 (1) (2013)
Yuan Qu, Jonathan F. Bard
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Comput. Oper. Res. 39 (10) (2012)
Ahmad I. Jarrah, Jonathan F. Bard
Large-scale pickup and delivery work area design. Comput. Oper. Res. 39 (12) (2012)
Ahmad I. Jarrah, Jonathan F. Bard
Pickup and delivery network segmentation using contiguous geographic clustering. J. Oper. Res. Soc. 62 (10) (2011)
Yumin Deng, Jonathan F. Bard
A reactive GRASP with path relinking for capacitated clustering. J. Heuristics 17 (2) (2011)
Jonathan F. Bard, Ahmad I. Jarrah, Jing Zan
Validating vehicle routing zone construction using Monte Carlo simulation. Eur. J. Oper. Res. 206 (1) (2010)
Jonathan F. Bard, Narameth Nananukul
A branch-and-price algorithm for an integrated production and inventory routing problem. Comput. Oper. Res. 37 (12) (2010)
Jonathan F. Bard, Narameth Nananukul
Heuristics for a multiperiod inventory routing problem with production decisions. Comput. Ind. Eng. 57 (3) (2009)
Jonathan F. Bard, Narameth Nananukul
The integrated production-inventory-distribution-routing problem. J. Sched. 12 (3) (2009)
Susan K. Monkman, Douglas J. Morrice, Jonathan F. Bard
A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs. Eur. J. Oper. Res. 187 (3) (2008)
Jonathan F. Bard, Lin Wan
Workforce Design with Movement Restrictions Between Workstation Groups. Manuf. Serv. Oper. Manag. 10 (1) (2008)
Guidong Zhu, Jonathan F. Bard, Gang Yu
A two-stage stochastic programming approach for project planning with uncertain activity durations. J. Sched. 10 (3) (2007)
Jonathan F. Bard, Hadi W. Purnomo
Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. J. Sched. 10 (1) (2007)
Jonathan F. Bard, David P. Morton, Yong Min Wang
Workforce planning at USPS mail processing and distribution centers using stochastic optimization. Ann. Oper. Res. 155 (1) (2007)
L. Wan, Jonathan F. Bard
Weekly staff scheduling with workstation group restrictions. J. Oper. Res. Soc. 58 (8) (2007)
Xinhui Zhang, Jonathan F. Bard
A multi-period machine assignment problem. Eur. J. Oper. Res. 170 (2) (2006)
Xinhui Zhang, Jonathan F. Bard
Comparative approaches to equipment scheduling in high volume factories. Comput. Oper. Res. 33 (2006)
Guidong Zhu, Jonathan F. Bard, Gang Yu
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem. INFORMS J. Comput. 18 (3) (2006)
Jonathan F. Bard, Lin Wan
The task assignment problem for unrestricted movement between workstation groups. J. Sched. 9 (4) (2006)
Xiangtong Qi, Jonathan F. Bard
Generating labor requirements and rosters for mail handlers using simulation and optimization. Comput. Oper. Res. 33 (2006)
G. Zhu, Jonathan F. Bard, G. Yu
Disruption management for resource-constrained project scheduling. J. Oper. Res. Soc. 56 (4) (2005)
Siwate Rojanasoonthon, Jonathan F. Bard
A GRASP for Parallel Machine Scheduling with Time Windows. INFORMS J. Comput. 17 (1) (2005)
Jonathan F. Bard, Hadi W. Purnomo
Preference scheduling for nurses using column generation. Eur. J. Oper. Res. 164 (2) (2005)
Xiangtong Qi, Jonathan F. Bard, Gang Yu
Class Scheduling for Pilot Training. Oper. Res. 52 (1) (2004)
Jonathan F. Bard
Selecting the appropriate input data set when configuring a permanent workforce. Comput. Ind. Eng. 47 (4) (2004)
Roger Z. Ríos-Mercado, Jonathan F. Bard
The Flow Shop Scheduling Polyhedron with Setup Time. J. Comb. Optim. 7 (3) (2003)
Siwate Rojanasoonthon, Jonathan F. Bard, S. D. Reddy
Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system. J. Oper. Res. Soc. 54 (8) (2003)
Jonathan F. Bard, Canan Binici, Anura H. deSilva
Staff scheduling at the United States Postal Service. Comput. Oper. Res. 30 (5) (2003)
Benjamin G. Thengvall, Jonathan F. Bard, Gang Yu
A Bundle Algorithm Approach for the Aircraft Schedule Recovery Problem During Hub Closures. Transp. Sci. 37 (4) (2003)
Xiangtong Qi, Gang Yu, Jonathan F. Bard
Single machine scheduling with assignable due dates. Discret. Appl. Math. 122 (1-3) (2002)
Jonathan F. Bard, George Kontoravdis, Gang Yu
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows. Transp. Sci. 36 (2) (2002)
Patrick Jaillet, Jonathan F. Bard, Liu Huang, Moshe Dror
Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework. Transp. Sci. 36 (3) (2002)
Benjamin Lev, János D. Pintér, Mark Kaiser, Jonathan F. Bard, Francis D. Tuggle, Ken R. McNaught, Lilian L. Barros, Antanas Zilinskas
Book Reviews. Interfaces 30 (4) (2000)
Jonathan F. Bard, John Plummer, Jean Claude Sourie
A bilevel programming approach to determining tax credits for biofuel production. Eur. J. Oper. Res. 120 (1) (2000)
Roger Z. Ríos-Mercado, Jonathan F. Bard
An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times. J. Heuristics 5 (1) (1999)
Jonathan F. Bard, Liu Huang, Patrick Jaillet, Moshe Dror
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities. Transp. Sci. 32 (2) (1998)
Roger Z. Ríos-Mercado, Jonathan F. Bard
Heuristics for the flow line problem with setup costs. Eur. J. Oper. Res. 110 (1) (1998)
Roger Z. Ríos-Mercado, Jonathan F. Bard
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Comput. Oper. Res. 25 (5) (1998)
Michael F. Argüello, Jonathan F. Bard, Gang Yu
A Grasp for Aircraft Routing in Response to Groundings and Delays. J. Comb. Optim. 1 (3) (1997)
Jonathan F. Bard
Heuristic Scheduling Systems with Applications to Production Systems and Project Management [Book Reviews]. Proc. IEEE 84 (2) (1996)
George Kontoravdis, Jonathan F. Bard
A GRASP for the Vehicle Routing Problem with Time Windows. INFORMS J. Comput. 7 (1) (1995)
Thomas A. Feo, Jonathan F. Bard, Scott D. Holland
Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly. Oper. Res. 43 (2) (1995)
Jonathan F. Bard, Krishnamurthi Venkatraman, Thomas A. Feo
Single machine scheduling with flow time and earliness penalties. J. Glob. Optim. 3 (3) (1993)
Samuel B. Graves, Jeffrey L. Ringuest, Jonathan F. Bard
Recent developments in screening methods for nondominated solutions in multiobjective optimization. Comput. Oper. Res. 19 (7) (1992)
Thomas A. Edmunds, Jonathan F. Bard
An algorithm for the mixed-integer nonlinear bilevel programming problem. Ann. Oper. Res. 34 (1992)
Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard
. Comput. Oper. Res. 18 (8) (1991)
Thomas A. Edmunds, Jonathan F. Bard
Algorithms for nonlinear bilevel mathematical programs. IEEE Trans. Syst. Man Cybern. 21 (1) (1991)
James T. Moore, Jonathan F. Bard
The Mixed Integer Linear Bilevel Programming Problem. Oper. Res. 38 (5) (1990)
Jonathan F. Bard, James T. Moore
A Branch and Bound Algorithm for the Bilevel Programming Problem. SIAM J. Sci. Comput. 11 (2) (1990)
Jonathan F. Bard, Jeanne L. Miller
Probabilistic shortest path problems with budgetary constraints. Comput. Oper. Res. 16 (2) (1989)
Jonathan F. Bard
Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation. Oper. Res. 36 (5) (1988)
Jonathan F. Bard
Convex two-level optimization. Math. Program. 40 (1-3) (1988)
Sangit Chatterjee, Jonathan F. Bard
A comparison of Box-Jenkins time series models with autoregressive processes. IEEE Trans. Syst. Man Cybern. 15 (2) (1985)
Jonathan F. Bard, Sangit Chatterjee
Objective function bounds for the inexact linear programming problem with generalized cost coefficients. Comput. Oper. Res. 12 (5) (1985)
Jonathan F. Bard
An investigation of the linear three level programming problem. IEEE Trans. Syst. Man Cybern. 14 (5) (1984)
Jonathan F. Bard
An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem. Oper. Res. 31 (4) (1983)
Jonathan F. Bard
An Algorithm for Solving the General Bilevel Programming Problem. Math. Oper. Res. 8 (2) (1983)
Jonathan F. Bard, James E. Falk
An explicit solution to the multi-level programming problem. Comput. Oper. Res. 9 (1) (1982)
Jonathan F. Bard, James E. Falk
A separable programming approach to the linear complementarity problem. Comput. Oper. Res. 9 (2) (1982)
Jonathan F. Bard
An engagement effectiveness model for surface ships. WSC (1981)
Jonathan F. Bard
Criminal justice dynamics: A planning model. WSC (1977)