This paper aims to propose a reliable location-allocation model where facilities are subject to the risk of disruptions. Since service facilities are expected to satisfy random and heavy demands, we model the congested situations in the system within a queuing framework which handles two sources of uncertainty associated with demand and service. To insure the service quality, a minimum limit re...

The downsizing and closing of state mental health institutions in Philadelphia in the 1990’s led to the development of a continuum care network of residential-based services. Although the diversity of care settings increased, congestion in facilities caused many patients to unnecessarily spend extra days in intensive facilities. This study applies a queuing network system with blocking to analy...

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. International Association for Energy Economics is collabo...

In hierarchical service networks, facilities at di erent levels provide di erent types of service. For example, in health care systems, general centers provide low-level services, such as primary health care, while specialized hospitals provide high-level services. Because of the demand congestion at service networks, the location of servers and their allocation of demand nodes can have a stron...

The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering locationallocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. This pa...

The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering location-allocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. In thi...

To address the ever increasing bandwidth requirements of next-generation high-performance systems, FPGA vendors are continually making incremental improvements in their device architectures. Even with these advanced architectures, designers often resort to implementing their designs using very wide on-chip buses. In fact, on-chip buses of 512, 1,024 or 2,048 bits wide are increasingly common. A...

This paper considers the problem of determining the lead-time and price to be quoted to a single order in a make-to-order manufacturing setting. The manufacturing system consists of several processing centers all subject to random failures and repairs. Because of a time window constraint on the delivery of the order, the latter has to be split among several processing centers to meet the constr...

The Transit Assignment Problem for congested public transport systems based on the formulation of De Cea and Fernandez (1993) has asymmetric cost functions that can be solved, among others methods, by the diagonalización procedure. In this work, an implementation of the origin based algorithm proposed by Bar-Gera (1999) is used to solve the convex problems generated by the diagonalización proce...