Lagrangian relaxation and constraint generation for allocation and advanced scheduling

DOI10.1016/j.cor.2011.11.017zbMath1251.90212OpenAlexW1981704813MaRDI QIDQ1761167

Archis Ghate, Yasin Gocgun

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.017

zbMATH Keywords

schedulingresource allocationapproximate dynamic programming

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (12)

Dynamic resource allocation: a flexible and tractable modeling framework ⋮ A novel approach to determine a tactical and operational decision for dynamic appointment scheduling at nuclear medical center ⋮ ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH ⋮ Scheduling operating rooms: achievements, challenges and pitfalls ⋮ Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking ⋮ An approximate dynamic programming approach to the admission control of elective patients ⋮ Approximate policy iteration for dynamic resource-constrained project scheduling ⋮ Dynamic multi-priority, multi-class patient scheduling with stochastic service times ⋮ Dynamic advance scheduling of outpatient appointments in a moving booking window ⋮ Multi-Priority Online Scheduling with Cancellations ⋮ Gittins' theorem under uncertainty ⋮ Robust control of the multi-armed bandit problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov decision models for the optimal maintenance of a production unit with an upstream buffer
• A genetic algorithm for the multidimensional knapsack problem
• Performance analysis of a single-server ATM queue with a priority scheduling.
• Discrete-time multiserver queues with geometric service times.
• Analysis of a discrete-time preemptive resume priority buffer
• Providing radiology health care services to stochastic demand of different customer classes
• Discrete time \(GI/Geom/1\) queueing system with priority
• Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management
• Managing Patient Service in a Diagnostic Medical Facility
• Revenue Management for a Primary-Care Clinic in the Presence of Patient Choice
• Relaxations of Weakly Coupled Stochastic Dynamic Programs
• Dynamic Multipriority Patient Scheduling for a Diagnostic Resource
• Stochastic task selection and renewable resource allocation
• The stochastic knapsack problem
• Discrete-time priority queues with two-state markov modulated arrivals
• Dynamic Scheduling of a Multiclass Queue: Discount Optimality
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
• A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations

This page was built for publication: Lagrangian relaxation and constraint generation for allocation and advanced scheduling