default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan F. Bard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j82]Jia Guo
, Jonathan F. Bard:
Air traffic controller scheduling. Comput. Ind. Eng. 191: 110123 (2024)- [j81]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): 4470-4493 (2024) - 2022
- [j80]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: 108151 (2022) - [j79]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: 105597 (2022) - [j78]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: 105807 (2022) - [j77]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): 783-807 (2022) - 2021
- [j76]Baturay Çalci, Benjamin D. Leibowicz, Jonathan F. Bard, Gopika G. Jayadev:
Incorporating learning-by-doing into mixed complementarity equilibrium models. Comput. Ind. Eng. 159: 107472 (2021) - 2020
- [j75]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): 177-209 (2020)
2010 – 2019
- 2019
- [j74]Youngbum Hur, Jonathan F. Bard, Markus M. Frey, Ferdinand Kiermaier:
A stochastic optimization approach to shift scheduling with breaks adjustments. Comput. Oper. Res. 107: 127-139 (2019) - [j73]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): 259-271 (2019) - [j72]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): 1037-1060 (2019) - [j71]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): 4351-4370 (2019) - [j70]Shihui Jia, Douglas J. Morrice, Jonathan F. Bard:
A performance analysis of dispatch rules for semiconductor assembly & test operations. J. Simulation 13(3): 163-180 (2019) - 2018
- [c4]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: 2624-2635 - 2017
- [j69]Chuwen Zhang, Jonathan F. Bard, Rodolfo Chacon:
Controlling work in process during semiconductor assembly and test operations. Int. J. Prod. Res. 55(24): 7251-7275 (2017) - 2016
- [j68]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): 715-726 (2016) - [j67]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): 911-927 (2016) - [j66]Ahmad I. Jarrah, Xiangtong Qi, Jonathan F. Bard:
The Destination-Loader-Door Assignment Problem for Automated Package Sorting Centers. Transp. Sci. 50(4): 1314-1336 (2016) - 2015
- [j65]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: 132-144 (2015) - [j64]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: 86-106 (2015) - [j63]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): 254-270 (2015) - 2014
- [j62]Jonathan F. Bard, Yufen Shao, Ahmad I. Jarrah:
A sequential GRASP for the therapist routing and scheduling problem. J. Sched. 17(2): 109-133 (2014) - 2013
- [j61]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): 295-323 (2013) - [j60]David P. Morton, Jonathan F. Bard:
Special Issue Dedicated to the Memory of Paul A. Jensen. INFORMS Trans. Educ. 14(1): 1-3 (2013) - [j59]Jens O. Brunner, Jonathan F. Bard:
Flexible weekly tour scheduling for postal service workers using a branch and price. J. Sched. 16(1): 129-149 (2013) - [c3]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: 2274-2286 - 2012
- [j58]Yuan Qu, Jonathan F. Bard:
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Comput. Oper. Res. 39(10): 2439-2456 (2012) - [j57]Ahmad I. Jarrah, Jonathan F. Bard:
Large-scale pickup and delivery work area design. Comput. Oper. Res. 39(12): 3102-3118 (2012) - 2011
- [j56]Yumin Deng, Jonathan F. Bard:
A reactive GRASP with path relinking for capacitated clustering. J. Heuristics 17(2): 119-152 (2011) - [j55]Ahmad I. Jarrah, Jonathan F. Bard:
Pickup and delivery network segmentation using contiguous geographic clustering. J. Oper. Res. Soc. 62(10): 1827-1843 (2011) - 2010
- [j54]Jonathan F. Bard, Narameth Nananukul:
A branch-and-price algorithm for an integrated production and inventory routing problem. Comput. Oper. Res. 37(12): 2202-2217 (2010) - [j53]Jonathan F. Bard, Ahmad I. Jarrah, Jing Zan:
Validating vehicle routing zone construction using Monte Carlo simulation. Eur. J. Oper. Res. 206(1): 73-85 (2010)
2000 – 2009
- 2009
- [j52]Jonathan F. Bard, Narameth Nananukul:
Heuristics for a multiperiod inventory routing problem with production decisions. Comput. Ind. Eng. 57(3): 713-723 (2009) - [j51]Jonathan F. Bard, Narameth Nananukul:
The integrated production-inventory-distribution-routing problem. J. Sched. 12(3): 257-280 (2009) - [r3]Jonathan F. Bard:
Bilevel Linear Programming. Encyclopedia of Optimization 2009: 221-224 - [r2]Jonathan F. Bard:
Bilevel Linear Programming: Complexity, Equivalence to Minmax, Concave Programs. Encyclopedia of Optimization 2009: 225-228 - [r1]Jonathan F. Bard:
Bilevel Programming in Management. Encyclopedia of Optimization 2009: 269-274 - 2008
- [j50]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): 1100-1114 (2008) - [j49]Jonathan F. Bard, Lin Wan:
Workforce Design with Movement Restrictions Between Workstation Groups. Manuf. Serv. Oper. Manag. 10(1): 24-42 (2008) - 2007
- [j48]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): 51-78 (2007) - [j47]L. Wan, Jonathan F. Bard:
Weekly staff scheduling with workstation group restrictions. J. Oper. Res. Soc. 58(8): 1030-1046 (2007) - [j46]Jonathan F. Bard, Hadi W. Purnomo:
Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. J. Sched. 10(1): 5-23 (2007) - [j45]Guidong Zhu, Jonathan F. Bard, Gang Yu:
A two-stage stochastic programming approach for project planning with uncertain activity durations. J. Sched. 10(3): 167-180 (2007) - 2006
- [j44]Xinhui Zhang, Jonathan F. Bard:
Comparative approaches to equipment scheduling in high volume factories. Comput. Oper. Res. 33: 132-157 (2006) - [j43]Xiangtong Qi, Jonathan F. Bard:
Generating labor requirements and rosters for mail handlers using simulation and optimization. Comput. Oper. Res. 33: 2645-2666 (2006) - [j42]Xinhui Zhang, Jonathan F. Bard:
A multi-period machine assignment problem. Eur. J. Oper. Res. 170(2): 398-415 (2006) - [j41]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): 377-390 (2006) - [j40]Jonathan F. Bard, Lin Wan:
The task assignment problem for unrestricted movement between workstation groups. J. Sched. 9(4): 315-341 (2006) - 2005
- [j39]Jonathan F. Bard, Hadi W. Purnomo:
Preference scheduling for nurses using column generation. Eur. J. Oper. Res. 164(2): 510-534 (2005) - [j38]Siwate Rojanasoonthon, Jonathan F. Bard:
A GRASP for Parallel Machine Scheduling with Time Windows. INFORMS J. Comput. 17(1): 32-51 (2005) - [j37]G. Zhu, Jonathan F. Bard, G. Yu:
Disruption management for resource-constrained project scheduling. J. Oper. Res. Soc. 56(4): 365-381 (2005) - 2004
- [j36]Jonathan F. Bard:
Selecting the appropriate input data set when configuring a permanent workforce. Comput. Ind. Eng. 47(4): 371-389 (2004) - [j35]Xiangtong Qi, Jonathan F. Bard, Gang Yu:
Class Scheduling for Pilot Training. Oper. Res. 52(1): 148-162 (2004) - 2003
- [j34]Jonathan F. Bard, Canan Binici, Anura H. deSilva:
Staff scheduling at the United States Postal Service. Comput. Oper. Res. 30(5): 745-771 (2003) - [j33]Roger Z. Ríos-Mercado, Jonathan F. Bard:
The Flow Shop Scheduling Polyhedron with Setup Time. J. Comb. Optim. 7(3): 291-318 (2003) - [j32]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): 806-821 (2003) - [j31]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): 392-407 (2003) - 2002
- [j30]Xiangtong Qi, Gang Yu, Jonathan F. Bard:
Single machine scheduling with assignable due dates. Discret. Appl. Math. 122(1-3): 211-233 (2002) - [j29]Jonathan F. Bard, George Kontoravdis, Gang Yu:
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows. Transp. Sci. 36(2): 250-269 (2002) - [j28]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): 292-300 (2002) - 2000
- [j27]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): 30-46 (2000) - [j26]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): 94-105 (2000)
1990 – 1999
- 1999
- [j25]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): 53-70 (1999) - 1998
- [j24]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): 351-366 (1998) - [j23]Roger Z. Ríos-Mercado, Jonathan F. Bard:
Heuristics for the flow line problem with setup costs. Eur. J. Oper. Res. 110(1): 76-98 (1998) - [j22]Jonathan F. Bard, Liu Huang, Patrick Jaillet, Moshe Dror:
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities. Transp. Sci. 32(2): 189-203 (1998) - 1997
- [j21]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): 211-228 (1997) - 1996
- [j20]Jonathan F. Bard:
Heuristic Scheduling Systems with Applications to Production Systems and Project Management [Book Reviews]. Proc. IEEE 84(2): 324 (1996) - 1995
- [j19]George Kontoravdis, Jonathan F. Bard:
A GRASP for the Vehicle Routing Problem with Time Windows. INFORMS J. Comput. 7(1): 10-23 (1995) - [j18]Thomas A. Feo, Jonathan F. Bard, Scott D. Holland:
Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly. Oper. Res. 43(2): 219-230 (1995) - 1993
- [j17]Jonathan F. Bard, Krishnamurthi Venkatraman, Thomas A. Feo:
Single machine scheduling with flow time and earliness penalties. J. Glob. Optim. 3(3): 289-309 (1993) - 1992
- [j16]Thomas A. Edmunds, Jonathan F. Bard:
An algorithm for the mixed-integer nonlinear bilevel programming problem. Ann. Oper. Res. 34: 149-162 (1992) - [j15]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): 683-694 (1992) - 1991
- [j14]Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard:
A GRASPTM for a difficult single machine scheduling problem, . Comput. Oper. Res. 18(8): 635-643 (1991) - [j13]Thomas A. Edmunds, Jonathan F. Bard:
Algorithms for nonlinear bilevel mathematical programs. IEEE Trans. Syst. Man Cybern. 21(1): 83-89 (1991) - 1990
- [j12]James T. Moore, Jonathan F. Bard:
The Mixed Integer Linear Bilevel Programming Problem. Oper. Res. 38(5): 911-921 (1990) - [j11]Jonathan F. Bard, James T. Moore:
A Branch and Bound Algorithm for the Bilevel Programming Problem. SIAM J. Sci. Comput. 11(2): 281-292 (1990)
1980 – 1989
- 1989
- [j10]Jonathan F. Bard, Jeanne L. Miller:
Probabilistic shortest path problems with budgetary constraints. Comput. Oper. Res. 16(2): 145-159 (1989) - 1988
- [j9]Jonathan F. Bard:
Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation. Oper. Res. 36(5): 756-766 (1988) - [j8]Jonathan F. Bard:
Convex two-level optimization. Math. Program. 40(1-3): 15-27 (1988) - 1985
- [j7]Jonathan F. Bard, Sangit Chatterjee:
Objective function bounds for the inexact linear programming problem with generalized cost coefficients. Comput. Oper. Res. 12(5): 483-491 (1985) - [j6]Sangit Chatterjee, Jonathan F. Bard:
A comparison of Box-Jenkins time series models with autoregressive processes. IEEE Trans. Syst. Man Cybern. 15(2): 252-259 (1985) - 1984
- [j5]Jonathan F. Bard:
An investigation of the linear three level programming problem. IEEE Trans. Syst. Man Cybern. 14(5): 711-717 (1984) - 1983
- [j4]Jonathan F. Bard:
An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem. Oper. Res. 31(4): 670-684 (1983) - [j3]Jonathan F. Bard:
An Algorithm for Solving the General Bilevel Programming Problem. Math. Oper. Res. 8(2): 260-272 (1983) - 1982
- [j2]Jonathan F. Bard, James E. Falk:
An explicit solution to the multi-level programming problem. Comput. Oper. Res. 9(1): 77-100 (1982) - [j1]Jonathan F. Bard, James E. Falk:
A separable programming approach to the linear complementarity problem. Comput. Oper. Res. 9(2): 153-159 (1982) - 1981
- [c2]Jonathan F. Bard:
An engagement effectiveness model for surface ships. WSC 1981: 83-88
1970 – 1979
- 1977
- [c1]Jonathan F. Bard:
Criminal justice dynamics: A planning model. WSC 1977: 258-268
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
