The following pages link to Jonathan F. Bard (Q322757):
Displaying 50 items.
- Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles (Q322758) (← links)
- Large-scale pickup and delivery work area design (Q339655) (← links)
- Flexible weekly tour scheduling for postal service workers using a branch and price (Q398850) (← links)
- A sequential GRASP for the therapist routing and scheduling problem (Q398907) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- Single machine scheduling with flow time and earliness penalties (Q686991) (← links)
- (Q752469) (redirect page) (← links)
- A decomposition technique for discrete time optimal control problems with an application to water resources management (Q752470) (← links)
- Inexact linear programming with generalized technological matrix sets (Q788633) (← links)
- A two-stage stochastic programming approach for project planning with uncertain activity durations (Q835555) (← links)
- The task assignment problem for unrestricted movement between workstation groups (Q880551) (← links)
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
- Time-axis decomposition of large-scale optimal control problems (Q911044) (← links)
- Some properties of the bilevel programming problem (Q911488) (← links)
- Validating vehicle routing zone construction using Monte Carlo simulation (Q976400) (← links)
- A branch-and-price algorithm for an integrated production and inventory routing problem (Q991383) (← links)
- Geometric and algorithmic developments for a hierarchical planning problem (Q1063518) (← links)
- Objective function bounds for the inexact linear programming problem with generalized cost coefficients (Q1085061) (← links)
- Convex two-level optimization (Q1109682) (← links)
- Probabilistic shortest path problems with budgetary constraints (Q1113810) (← links)
- A GRASP for a difficult single machine scheduling problem (Q1184452) (← links)
- An algorithm for the mixed-integer nonlinear bilevel programming problem (Q1184528) (← links)
- Heuristics for the flow line problem with setup costs (Q1303708) (← links)
- Practical bilevel optimization. Algorithms and applications (Q1304175) (← links)
- A GRASP for aircraft routing in response to groundings and delays (Q1383787) (← links)
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
- The flow shop scheduling polyhedron with setup times (Q1417853) (← links)
- A bilevel programming approach to determining tax credits for biofuel production (Q1579459) (← links)
- Bundle trust-region algorithm for bilinear bilevel programming (Q1608138) (← links)
- Single machine scheduling with assignable due dates (Q1613425) (← links)
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation (Q1728503) (← links)
- A stochastic optimization approach to shift scheduling with breaks adjustments (Q1738827) (← links)
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times (Q1806709) (← links)
- Staff scheduling at the United States postal Service (Q1870829) (← links)
- Strategic interactions between liquefied natural gas and domestic gas markets: a bilevel model (Q2147090) (← links)
- The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers (Q2173054) (← links)
- The integrated production-inventory-distribution-routing problem (Q2268506) (← links)
- Preference scheduling for nurses using column generation (Q2387240) (← links)
- A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines (Q2393485) (← links)
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs (Q2467257) (← links)
- Workforce planning at USPS mail processing and distribution centers using stochastic optimization (Q2468733) (← links)
- Generating labor requirements and rosters for mail handlers using simulation and optimization (Q2489309) (← links)
- Comparative approaches to equipment scheduling in high volume factories (Q2565775) (← links)
- A multi-period machine assignment problem (Q2572247) (← links)
- A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime (Q2669701) (← links)
- (Q2712290) (← links)
- A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities (Q2783806) (← links)
- A GRASP for Parallel Machine Scheduling with Time Windows (Q2890455) (← links)
- A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem (Q2892296) (← links)
