Bard Jonathan F.

Jonathan F. Bard

Information about the author Jonathan F. Bard will soon be added to the site.
Found 50 papers in total
Workforce planning at USPS mail processing and distribution centers using stochastic optimization
2007
Service organizations that operate outside the normal 8-hour day and face wide...
Weekly staff scheduling with workstation group restrictions
2007
This paper addresses the weekly adjustment problem for staff scheduling when movement...
A two-stage stochastic programming approach for project planning with uncertain activity durations
2007
This paper investigates the problem of setting target finish times (due dates) for...
Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
2007
This paper addresses the problem of developing cyclic schedules for nurses while...
Cyclic preference scheduling for nurses using branch and price
2007
This paper presents a new methodology to solve the cyclic preference scheduling...
The task assignment problem for unrestricted movement between workstation groups
2006
The purpose of this paper is to investigate the problem of assigning tasks to workers...
Class scheduling for pilot training
2004
In this paper, we study the class scheduling problem at the training center of...
A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
2006
This paper presents a branch-and-price algorithm for scheduling n jobs on m...
Generating labor requirements and rosters for mail handlers using simulation and optimization
2006
In this research, we introduce a dual-purpose simulation model that integrates two...
A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
2006
This paper considers the multimode resource-constrained project-scheduling problem...
Disruption management for machine scheduling: The case of shortest processing time schedules
2006
This paper addresses the problem of updating a machine schedule when either a random...
Incremental changes in the workforce to accommodate changes in demand
2006
In many service organizations, rosters must be constructed weekly or monthly as demand...
A multi-period machine assignment problem
2006
In this paper, a multi-period assignment problem is studied that arises as part of a...
A GRASP for parallel machine scheduling with time windows
2005
This paper presents a greedy randomized adaptive search procedure (GRASP) for...
Comparative approaches to equipment scheduling in high volume factories
2006
Mail processing and distribution centers (P&DCs) are large factories that accept,...
Preference scheduling for nurses using column generation
2005
The purpose of this paper is to present a new methodology for scheduling nurses in...
Short-term nurse scheduling in response to daily fluctuations in supply and demand
2005
Hourly changes in patient census and acuity require hospitals to update their staffing...
A column generation-based approach to solve the preference scheduling problem for nurses with downgrading
2005
The demand for nurses in virtually all western countries has been outpacing the supply...
Selecting the appropriate input data set when configuring a permanent workforce
2004
This paper explores the issue of choosing the best data to use when running a...
Supply chain coordination with demand disruptions
2004
The purpose of this paper is to investigate a one-supplier–one-retailer supply...
A bundle algorithm approach for the aircraft schedule recovery problem during hub closures
2003
A bundle algorithm is presented to solve a multicommodity network model for...
The flow shop scheduling polyhedron with setup times
2003
This paper addresses the problem of improving the polyhedral representation of a...
Delivery cost approximations for inventory routing problems in a rolling horizon framework
2002
The inventory routing problem considered in this paper is concerned with the repeated...
Delivery cost approximations for inventory routing problems in a rolling horizon framework
2002
The inventory routing problem considered in this paper is concerned with the repeated...
Papers per page: