| 2009 |
|---|
| 24 | EE | Jonathan F. Bard:
Bilevel Linear Programming.
Encyclopedia of Optimization 2009: 221-224 |
| 23 | EE | Jonathan F. Bard:
Bilevel Linear Programming: Complexity, Equivalence to Minmax, Concave Programs.
Encyclopedia of Optimization 2009: 225-228 |
| 22 | EE | Jonathan F. Bard:
Bilevel Programming in Management.
Encyclopedia of Optimization 2009: 269-274 |
| 2008 |
|---|
| 21 | EE | 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) |
| 2007 |
|---|
| 20 | EE | 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) |
| 19 | EE | Jonathan F. Bard,
Hadi W. Purnomo:
Cyclic preference scheduling of nurses using a Lagrangian-based heuristic.
J. Scheduling 10(1): 5-23 (2007) |
| 18 | EE | 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 |
|---|
| 17 | EE | Xinhui Zhang,
Jonathan F. Bard:
Comparative approaches to equipment scheduling in high volume factories.
Computers & OR 33: 132-157 (2006) |
| 16 | EE | Xiangtong Qi,
Jonathan F. Bard:
Generating labor requirements and rosters for mail handlers using simulation and optimization.
Computers & OR 33: 2645-2666 (2006) |
| 15 | EE | Xinhui Zhang,
Jonathan F. Bard:
A multi-period machine assignment problem.
European Journal of Operational Research 170(2): 398-415 (2006) |
| 14 | EE | Jonathan F. Bard,
Lin Wan:
The task assignment problem for unrestricted movement between workstation groups.
J. Scheduling 9(4): 315-341 (2006) |
| 2005 |
|---|
| 13 | EE | Jonathan F. Bard,
Hadi W. Purnomo:
Preference scheduling for nurses using column generation.
European Journal of Operational Research 164(2): 510-534 (2005) |
| 2003 |
|---|
| 12 | EE | Jonathan F. Bard,
Canan Binici,
Anura H. deSilva:
Staff scheduling at the United States Postal Service.
Computers & OR 30(5): 745-771 (2003) |
| 11 | EE | Roger Z. Ríos-Mercado,
Jonathan F. Bard:
The Flow Shop Scheduling Polyhedron with Setup Time.
J. Comb. Optim. 7(3): 291-318 (2003) |
| 2002 |
|---|
| 10 | | Xiangtong Qi,
Gang Yu,
Jonathan F. Bard:
Single machine scheduling with assignable due dates.
Discrete Applied Mathematics 122(1-3): 211-233 (2002) |
| 1999 |
|---|
| 9 | | 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 |
|---|
| 8 | EE | 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) |
| 1997 |
|---|
| 7 | | 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) |
| 1992 |
|---|
| 6 | EE | 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 | EE | 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 | EE | Jonathan F. Bard,
Jeanne L. Miller:
Probabilistic shortest path problems with budgetary constraints.
Computers & OR 16(2): 145-159 (1989) |
| 1985 |
|---|
| 3 | EE | 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 | EE | Jonathan F. Bard,
James E. Falk:
An explicit solution to the multi-level programming problem.
Computers & OR 9(1): 77-100 (1982) |
| 1 | EE | Jonathan F. Bard,
James E. Falk:
A separable programming approach to the linear complementarity problem.
Computers & OR 9(2): 153-159 (1982) |
