Online Scheduling with General Cost Functions

2014 ◽  
Vol 43 (1) ◽  
pp. 126-143 ◽  
Author(s):  
Sungjin Im ◽  
Benjamin Moseley ◽  
Kirk Pruhs
Keyword(s):  
Online Scheduling ◽  
Cost Functions ◽  
General Cost Functions

Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule

2020 ◽  
Vol 68 (4) ◽  
pp. 1218-1230
Author(s):  
Zhenghua Long ◽  
Nahum Shimkin ◽  
Hailun Zhang ◽  
Jiheng Zhang
Keyword(s):  
Queue Length ◽  
Dynamic Scheduling ◽  
Cost Functions ◽  
Hazard Rates ◽  
Service Capacity ◽  
Allocation Policy ◽  
Many Server Queues ◽  
Priority Order ◽  
General Cost Functions ◽  
Queues With Abandonment

In “Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule,” Long, Shimkin, Zhang, and Zhang propose three scheduling policies to cope with any general cost functions and general patience-time distributions. Their first contribution is to introduce the target-allocation policy, which assigns higher priority to customer classes with larger deviation from the desired allocation of the service capacity and prove its optimality for any general queue-length cost functions and patience-time distributions. The Gcμ/h rule, which extends the well-known Gcμ rule by taking abandonment into account, is shown to be optimal for the case of convex queue-length costs and nonincreasing hazard rates of patience. For the case of concave queue-length costs but nondecreasing hazard rates of patience, it is optimal to apply a fixed-priority policy, and a knapsack-like problem is developed to determine the optimal priority order efficiently.

The Retention Effect of Withholding Performance Information

2007 ◽  
Vol 82 (2) ◽  
pp. 389-425 ◽  
Author(s):  
Korok Ray
Keyword(s):  
Performance Evaluations ◽  
Cost Functions ◽  
Equilibrium Strategy ◽  
Performance Information ◽  
Outside Options ◽  
Pooling Equilibrium ◽  
General Cost Functions ◽  
Multiple Stages

It is a common practice for firms to conduct performance evaluations of their employees and yet to withhold this information from those employees. This paper argues that firms strategically withhold performance information to retain workers. In particular, if the worker enjoys high outside options and is tempted to quit, then the firm chooses not to reveal his performance information in order to keep him on the job. The firm's equilibrium strategy is to fire if performance is sufficiently low, reveal information if performance is sufficiently high, and withhold information otherwise. The pooling equilibrium is robust under a wide variety of settings, such as general cost functions, ability-contingent outside options, nonlinear contracts, nonverifiable output, and multiple stages of production.

scholarly journals On the Huffman and Alphabetic Tree Problem with General Cost Functions

Algorithmica ◽  
2013 ◽  
Vol 69 (3) ◽  
pp. 582-604 ◽  
Author(s):  
Hiroshi Fujiwara ◽  
Tobias Jacobs
Keyword(s):  
Cost Functions ◽  
General Cost Functions
Sign in / Sign up

Export Citation Format

Share Document