-
作者：Altman, E; Shimkin, N
作者单位：Inria; Technion Israel Institute of Technology
摘要：We consider a processor-sharing service system, where the service rate to individual customers decreases as the load increases. Each arriving customer may observe the current load and should then choose whether to join the shared system. The alternative is a constant-cost option, modeled here for concreteness as a private server (e.g., a personal computer that serves as an alternative to a central mainframe computer). The customers wish to minimize their individual service times (or an increas...
-
作者：Lederer, PJ; Nambimadom, RS
作者单位：University of Rochester
摘要：The goal of this paper is to understand choices of networks and schedules by a profit maximizing airline. By network we mean the routing pattern for planes and by schedule we mean the frequency of service between cities and the amount of time put into the schedule to assure on-time arrival. This paper analyzes network and schedule choice using an idealized model that permits derivation of analytic, closed form expressions for airline and passenger costs. Many important conclusions are obtained...
-
作者：Chatwin, RE
摘要：Consider a multiperiod airline overbooking problem that relates to a single-leg flight and a single service class. Passengers may cancel their reservations at any time, including being no-shows at flight-time. At that time, the airline bumps passengers in excess of flight capacity and pays a penalty for so doing. We give conditions on the fares, refunds, and distributions of passenger demand for reservations and cancellations in each period, and on the bumping penalty function, that ensure tha...
-
作者：Caprara, A; Toth, P; Vigo, D; Fischetti, M
作者单位：University of Bologna; University of Udine
摘要：The Crew Rostering Problem (CRP) aims at determining an optimal sequencing of a given set of duties into rosters satisfying operational constraints deriving from union contract and company regulations. Previous work on CRP addresses mainly urban mass-transit systems, in which the minimum number of crews to perform the duties can easily be determined, and the objective is to evenly distribute the workload among the crews. In typical railway applications, however, the roster construction has to ...
-
作者：Song, JS
作者单位：University of California System; University of California Irvine
摘要：A customer order to a multi-item inventory system typically consists of several different items in different amounts. The probability of satisfying an arbitrary demand within a prespecified time window, termed the order fill rate, is an important measure of customer satisfaction in industry. This measure, however, has received little attention in the inventory literature, partly because its evaluation is considered a hard problem. In this paper, we study this performance measure for a base-sto...
-
作者：Rajagopalan, S
作者单位：University of Southern California
摘要：Businesses frequently have to decide which of their existing equipment to replace, taking into account future changes in capacity requirements. The significance of this decision becomes clear when one notes that expenditure on new plant and equipment is a significant proportion of the GDP in the United States. The equipment replacement literature has focused on the replacement issue, usually ignoring aspects such as future demand changes and economies of scale. On the other hand, the capacity ...
-
作者：Glasserman, P; Wang, YS
作者单位：Columbia University; Massachusetts Institute of Technology (MIT)
摘要：This paper studies the trade-off between inventory levels and the delivery leadtime offered to customers iir achieving a target level of service. It addresses the question of how much a delivery leadtime can be reduced, per unit increase in Inventory, at a fixed fill rate. We show that for a class of assemble-to-order models with stochastic demands and production intervals there is a simple linear trade-off between inventory and delivery leadtime, in a limiting sense, at high fill rates. The l...
-
作者：Kaminsky, P; Simchi-Levi, D
作者单位：University of California System; University of California Berkeley; Northwestern University
摘要：In the flow shop weighted completion time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize the sum of the weighted completion times of all jobs on the final machine. In this paper, we present a characterization of the asymptotic optimal solution value for general distributions of the job proce...
-
作者：Federgruen, A; Katalan, Z
作者单位：Columbia University; University of Pennsylvania
摘要：In this paper we address periodic base-stock policies for stochastic economic lot scheduling problems. These represent manufacturing settings in which multiple items compete for the availability of a common capacity source, in the presence of setup times and/or costs, incurred when switching between items, and in the presence of uncertainty regarding demand patterns, production, and setup times. Under periodic base-stock policies, items are produced according to a given periodic item-sequence....
-
作者：Kapuscinski, R; Tayur, S
作者单位：Carnegie Mellon University
摘要：For a single product, single-stage capacitated production-inventory model with stochastic, periodic (cyclic) demand, we find the optimal policy and characterize some of its properties. We study the finite-horizon, the discounted infinite-horizon and the infinite-horizon average cases; A simulation based optimization method is provided to compute the optimal parameters. Based on a numerical study, several insights into the model are also provided.
