Jonathan F. Bard

	2012
40		Yuan Qu, Jonathan F. Bard: A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Computers & OR 39(10): 2439-2456 (2012)
	2011
39		Yumin Deng, Jonathan F. Bard: A reactive GRASP with path relinking for capacitated clustering. J. Heuristics 17(2): 119-152 (2011)
38		Ahmad I. Jarrah, Jonathan F. Bard: Pickup and delivery network segmentation using contiguous geographic clustering. JORS 62(10): 1827-1843 (2011)
	2010
37		Jonathan F. Bard, Narameth Nananukul: A branch-and-price algorithm for an integrated production and inventory routing problem. Computers & OR 37(12): 2202-2217 (2010)
36		Jonathan F. Bard, Ahmad I. Jarrah, Jing Zan: Validating vehicle routing zone construction using Monte Carlo simulation. European Journal of Operational Research 206(1): 73-85 (2010)
	2009
35		Jonathan F. Bard: Bilevel Linear Programming. Encyclopedia of Optimization 2009: 221-224
34		Jonathan F. Bard: Bilevel Linear Programming: Complexity, Equivalence to Minmax, Concave Programs. Encyclopedia of Optimization 2009: 225-228
33		Jonathan F. Bard: Bilevel Programming in Management. Encyclopedia of Optimization 2009: 269-274
32		Jonathan F. Bard, Narameth Nananukul: Heuristics for a multiperiod inventory routing problem with production decisions. Computers & Industrial Engineering 57(3): 713-723 (2009)
31		Jonathan F. Bard, Narameth Nananukul: The integrated production-inventory-distribution-routing problem. J. Scheduling 12(3): 257-280 (2009)
	2008
30		Susan K. Monkman, Douglas J. Morrice, Jonathan F. Bard: A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs. European Journal of Operational Research 187(3): 1100-1114 (2008)
29		Jonathan F. Bard, Lin Wan: Workforce Design with Movement Restrictions Between Workstation Groups. Manufacturing & Service Operations Management 10(1): 24-42 (2008)
	2007
28		Jonathan F. Bard, David P. Morton, Yong Min Wang: Workforce planning at USPS mail processing and distribution centers using stochastic optimization. Annals OR 155(1): 51-78 (2007)
27		Jonathan F. Bard, Hadi W. Purnomo: Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. J. Scheduling 10(1): 5-23 (2007)
26		Guidong Zhu, Jonathan F. Bard, Gang Yu: A two-stage stochastic programming approach for project planning with uncertain activity durations. J. Scheduling 10(3): 167-180 (2007)
	2006
25		Xinhui Zhang, Jonathan F. Bard: Comparative approaches to equipment scheduling in high volume factories. Computers & OR 33: 132-157 (2006)
24		Xiangtong Qi, Jonathan F. Bard: Generating labor requirements and rosters for mail handlers using simulation and optimization. Computers & OR 33: 2645-2666 (2006)
23		Xinhui Zhang, Jonathan F. Bard: A multi-period machine assignment problem. European Journal of Operational Research 170(2): 398-415 (2006)
22		Guidong Zhu, Jonathan F. Bard, Gang Yu: A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem. INFORMS Journal on Computing 18(3): 377-390 (2006)
21		Jonathan F. Bard, Lin Wan: The task assignment problem for unrestricted movement between workstation groups. J. Scheduling 9(4): 315-341 (2006)
	2005
20		Jonathan F. Bard, Hadi W. Purnomo: Preference scheduling for nurses using column generation. European Journal of Operational Research 164(2): 510-534 (2005)
	2004
19		Xiangtong Qi, Jonathan F. Bard, Gang Yu: Class Scheduling for Pilot Training. Operations Research 52(1): 148-162 (2004)
	2003
18		Jonathan F. Bard, Canan Binici, Anura H. deSilva: Staff scheduling at the United States Postal Service. Computers & OR 30(5): 745-771 (2003)
17		Roger Z. Ríos-Mercado, Jonathan F. Bard: The Flow Shop Scheduling Polyhedron with Setup Time. J. Comb. Optim. 7(3): 291-318 (2003)
16		Benjamin G. Thengvall, Jonathan F. Bard, Gang Yu: A Bundle Algorithm Approach for the Aircraft Schedule Recovery Problem During Hub Closures. Transportation Science 37(4): 392-407 (2003)
	2002
15		Xiangtong Qi, Gang Yu, Jonathan F. Bard: Single machine scheduling with assignable due dates. Discrete Applied Mathematics 122(1-3): 211-233 (2002)
14		Jonathan F. Bard, George Kontoravdis, Gang Yu: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows. Transportation Science 36(2): 250-269 (2002)
13		Patrick Jaillet, Jonathan F. Bard, Liu Huang, Moshe Dror: Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework. Transportation Science 36(3): 292-300 (2002)
	2000
12		Jonathan F. Bard, John Plummer, Jean Claude Sourie: A bilevel programming approach to determining tax credits for biofuel production. European Journal of Operational Research 120(1): 30-46 (2000)
	1999
11		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
10		Roger Z. Ríos-Mercado, Jonathan F. Bard: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Computers & OR 25(5): 351-366 (1998)
9		Jonathan F. Bard, Liu Huang, Patrick Jaillet, Moshe Dror: A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities. Transportation Science 32(2): 189-203 (1998)
	1997
8		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)
	1995
7		George Kontoravdis, Jonathan F. Bard: A GRASP for the Vehicle Routing Problem with Time Windows. INFORMS Journal on Computing 7(1): 10-23 (1995)
	1992
6		Samuel B. Graves, Jeffrey L. Ringuest, Jonathan F. Bard: Recent developments in screening methods for nondominated solutions in multiobjective optimization. Computers & OR 19(7): 683-694 (1992)
	1991
5		Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard: A GRASPTM for a difficult single machine scheduling problem, . Computers & OR 18(8): 635-643 (1991)
	1989
4		Jonathan F. Bard, Jeanne L. Miller: Probabilistic shortest path problems with budgetary constraints. Computers & OR 16(2): 145-159 (1989)
	1985
3		Jonathan F. Bard, Sangit Chatterjee: Objective function bounds for the inexact linear programming problem with generalized cost coefficients. Computers & OR 12(5): 483-491 (1985)
	1982
2		Jonathan F. Bard, James E. Falk: An explicit solution to the multi-level programming problem. Computers & OR 9(1): 77-100 (1982)
1		Jonathan F. Bard, James E. Falk: A separable programming approach to the linear complementarity problem. Computers & OR 9(2): 153-159 (1982)

Coauthor Index

1	Michael F. Argüello	[8]
2	Canan Binici	[18]
3	Sangit Chatterjee	[3]
4	Yumin Deng	[39]
5	Moshe Dror	[9] [13]
6	James E. Falk	[1] [2]
7	Thomas A. Feo	[5]
8	Samuel B. Graves	[6]
9	Liu Huang	[9] [13]
10	Patrick Jaillet	[9] [13]
11	Ahmad I. Jarrah	[36] [38]
12	George Kontoravdis	[7] [14]
13	Jeanne L. Miller	[4]
14	Susan K. Monkman	[30]
15	Douglas J. Morrice	[30]
16	David P. Morton	[28]
17	Narameth Nananukul	[31] [32] [37]
18	John Plummer	[12]
19	Hadi W. Purnomo	[20] [27]
20	Xiangtong Qi	[15] [19] [24]
21	Yuan Qu	[40]
22	Jeffrey L. Ringuest	[6]
23	Roger Z. Ríos-Mercado	[10] [11] [17]
24	Jean Claude Sourie	[12]
25	Benjamin G. Thengvall	[16]
26	Krishnamurthi Venkatraman	[5]
27	Lin Wan	[21] [29]
28	Yong Min Wang	[28]
29	Gang Yu	[8] [14] [15] [16] [19] [22] [26]
30	Jing Zan	[36]
31	Xinhui Zhang	[23] [25]
32	Guidong Zhu	[22] [26]
33	Anura H. deSilva	[18]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page