Dynamic resource allocation: a flexible and tractable modeling framework

DOI10.1016/J.EJOR.2013.10.063zbMath1338.90158OpenAlexW2062379995MaRDI QIDQ299823

Shubham Gupta, Guglielmo Lulli, Dimitris J. Bertsimas

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.063

zbMATH Keywords

fairnessschedulingresource allocationapplications of integer optimization

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

Inequity averse optimization in operational research ⋮ Stochastic Simulation Optimization for Route Selection Strategy Based on Flight Delay Cost ⋮ A two-stage stochastic variational inequality model for storage and dynamic distribution of medical supplies in epidemic management ⋮ A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems ⋮ Fair resource allocation: using welfare-based dominance constraints ⋮ Modelling and solving resource allocation problems via a dynamic programming approach ⋮ Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities ⋮ Mixed Integer Linear Programming Formulation Techniques

Cites Work

• Unnamed Item
• Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
• A branch and bound algorithm for the job-shop scheduling problem
• Lagrangian relaxation and constraint generation for allocation and advanced scheduling
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• The Air Traffic Flow Management Problem with Enroute Capacities
• Multiairport Ground Holding Problem: A Computational Evaluation of Exact Algorithms
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• An Integer Optimization Approach to Large-Scale Air Traffic Flow Management
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• A Computational Study of the Job-Shop Scheduling Problem
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• The Schedule-Sequencing Problem
• A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations
• Algorithms for Solving Production-Scheduling Problems
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Dynamic resource allocation: a flexible and tractable modeling framework