Jonathan F. Bard

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