The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jonathan F. Bard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jonathan F. Bard, Canan Binici, Anura H. deSilva
    Staff scheduling at the United States Postal Service. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:5, pp:745-771 [Journal]
  2. Jonathan F. Bard, Sangit Chatterjee
    Objective function bounds for the inexact linear programming problem with generalized cost coefficients. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1985, v:12, n:5, pp:483-491 [Journal]
  3. Jonathan F. Bard, James E. Falk
    An explicit solution to the multi-level programming problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1982, v:9, n:1, pp:77-100 [Journal]
  4. Jonathan F. Bard, Jeanne L. Miller
    Probabilistic shortest path problems with budgetary constraints. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1989, v:16, n:2, pp:145-159 [Journal]
  5. Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard
    A GRASPTM for a difficult single machine scheduling problem, . [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1991, v:18, n:8, pp:635-643 [Journal]
  6. Jonathan F. Bard, James E. Falk
    A separable programming approach to the linear complementarity problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1982, v:9, n:2, pp:153-159 [Journal]
  7. Samuel B. Graves, Jeffrey L. Ringuest, Jonathan F. Bard
    Recent developments in screening methods for nondominated solutions in multiobjective optimization. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1992, v:19, n:7, pp:683-694 [Journal]
  8. Xiangtong Qi, Jonathan F. Bard
    Generating labor requirements and rosters for mail handlers using simulation and optimization. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:2645-2666 [Journal]
  9. Roger Z. Ríos-Mercado, Jonathan F. Bard
    Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1998, v:25, n:5, pp:351-366 [Journal]
  10. Xinhui Zhang, Jonathan F. Bard
    Comparative approaches to equipment scheduling in high volume factories. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:132-157 [Journal]
  11. Xiangtong Qi, Gang Yu, Jonathan F. Bard
    Single machine scheduling with assignable due dates. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:211-233 [Journal]
  12. Roger Z. Ríos-Mercado, Jonathan F. Bard
    An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1999, v:5, n:1, pp:53-70 [Journal]
  13. Michael F. Argüello, Jonathan F. Bard, Gang Yu
    A Grasp for Aircraft Routing in Response to Groundings and Delays. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1997, v:1, n:3, pp:211-228 [Journal]
  14. Roger Z. Ríos-Mercado, Jonathan F. Bard
    The Flow Shop Scheduling Polyhedron with Setup Time. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:3, pp:291-318 [Journal]
  15. Jonathan F. Bard, Lin Wan
    The task assignment problem for unrestricted movement between workstation groups. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:4, pp:315-341 [Journal]
  16. Jonathan F. Bard, Hadi W. Purnomo
    Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2007, v:10, n:1, pp:5-23 [Journal]
  17. Xinhui Zhang, Jonathan F. Bard
    A multi-period machine assignment problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:170, n:2, pp:398-415 [Journal]
  18. Jonathan F. Bard, Hadi W. Purnomo
    Preference scheduling for nurses using column generation. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:164, n:2, pp:510-534 [Journal]
  19. Guidong Zhu, Jonathan F. Bard, Gang Yu
    A two-stage stochastic programming approach for project planning with uncertain activity durations. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2007, v:10, n:3, pp:167-180 [Journal]

  20. A branch-and-price algorithm for an integrated production and inventory routing problem. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002