MYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUE

DOI10.1017/S0269964816000474zbMath1411.90169arXiv1606.04136OpenAlexW2962885449MaRDI QIDQ4628406

Neal Master, Nicholas Bambos, Carri W. Chan

Publication date: 13 March 2019

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.04136

zbMATH Keywords

stochastic dynamic programmingstochastic modellingoperations research

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)

Related Items (1)

ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling broadcasts with deadlines
• Multi‐Armed Bandit Allocation Indices
• Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems
• Dynamic Multipriority Patient Scheduling for a Diagnostic Resource
• Inventory Models with Shelf-Age and Delay-Dependent Inventory Costs
• SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
• Improved On-Line Broadcast Scheduling with Deadlines
• On an index policy for restless bandits
• TOPSIS method for hesitant fuzzy multiple attribute decision making
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• User Delay Costs and Internal Pricing for a Service Facility

This page was built for publication: MYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUE