Showing 1 - 10 of 103
The Shift Design Problem is an important optimization problem which arises when scheduling personnel in industries that require continuous operation. Based on the forecast, required staffing levels for a set of time periods, a set of shift types that best covers the demand must be determined. A...
Persistent link: https://www.econbiz.de/10011262895
This paper addresses the Patient Admission Scheduling (PAS) problem. The PAS problem deals with assigning elective patients to beds, satisfying a number of soft and hard constraints. The problem can be seen as part of the functions of hospital management at an operational level. There exists a...
Persistent link: https://www.econbiz.de/10010611664
In this paper we present a new scheduling problem and describe a shortest path based heuristic as well as a dynamic programming based exact optimization algorithm to solve it. The Selective Multi-Category Parallel-Servicing Problem (SMCPSP) arises when a set of jobs has to be scheduled on a...
Persistent link: https://www.econbiz.de/10010616690
In this paper we consider a label-setting dynamic-programming algorithm for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). We use a pseudo resource to guarantee that labels are permanent. We observe that storing the states based on the subset of nodes visited by the...
Persistent link: https://www.econbiz.de/10010699982
This paper introduces a concept of inequality comparisons with ordinal bivariate categorical data. In our model, one population is more unequal than another when they have common arithmetic median outcomes and the first can be obtained from the second by correlation-increasing switches and/or...
Persistent link: https://www.econbiz.de/10011157180
We consider a congested facility where agents can line up at any time they wish after the facility opens (like airplane boarding, or drivers leaving stadium parking lots after a sports event). We show that in Nash equilibrium, within the general family of stochastic queue disciplines with no...
Persistent link: https://www.econbiz.de/10010818956
We consider the problem of assigning agents to a facility, represented by slots on a line, where only one agent can be served at a time. There is a finite number of agents, and each one wants to be served as close as possible to his preferred slot. We first consider deterministic assignment of...
Persistent link: https://www.econbiz.de/10010818957
We analyze a general model of rationing in which agents have baselines, in addition to claims against the (insufficient) endowment of the good to be allocated. Many real-life problems fit this general model (e.g., bankruptcy with prioritized claims, resource allocation in the public health care...
Persistent link: https://www.econbiz.de/10010818971
We consider a class of three-player queuing games where players independently choose when to arrive at a bottleneck facility that serves only one at a time. Players are impatient for service but cannot arrive before the facility opens and they dislike time spent in queue. We derive the...
Persistent link: https://www.econbiz.de/10010886166
We consider the problem of distributing the proceeds generated from a joint venture in which the participating agents are hierarchically organized. We characterize a family of allocation rules ranging from the so-called zero-transfer rule (which awards agents in the hierarchy their individually...
Persistent link: https://www.econbiz.de/10011171784