-
作者：Day, PR; Ryan, DM
摘要：The construction of flight attendant (cabin crew) rosters for short-haul (domestic) airline flight services that satisfies rostering constraints and employment contract regulations is a combinatorially complex problem. In this paper the problem is described and an effective optimisation-based solution method is introduced. The rostering problem involves the allocation of days-off and various duties to each crew member over a roster period. The days-off and the duty allocation problems are sepa...
-
作者：Griggs, BJ; Parnell, GS; Lehmkuhl, LJ
作者单位：Virginia Commonwealth University; United States Department of Defense; United States Air Force; US Air Force Research Laboratory
摘要：This paper describes the development of an air mission planning algorithm for the Joint Stochastic Warfare Analysis Research (JSTOCHWAR). The overall problem scope was to develop an algorithm to handle major factors bearing on the combat mission planning problem while providing hook-ups for the JSTOCHWAR architecture. Other aspects of the problem included finding the appropriate level of detail, developing a fast solving technique, and attempting to use existing data. The problem was handled b...
-
作者：Gans, N; VanRyzin, G
作者单位：Columbia University
摘要：We consider a general class of queueing systems with multiple job types and a flexible service facility. The arrival limes and sizes of incoming jobs are random, and correlations among the sizes of arriving job types are allowed. By choosing among a finite set of configurations, the facility can dynamically control the rates at which it serves the various job types. We define system work at any given time as the minimum time required to process all jobs currently in the backlog. This quantity ...
-
作者：Moinzadeh, K; Aggarwal, PK
作者单位：William & Mary
摘要：In this paper we study a (S-1, S) type multiechelon inventory system where all the stocking locations have the option to replenish their inventory through either a normal or a more expensive emergency resupply channel. When ordering a unit, each stocking location decides which channel to use based on its inventory level and the remaining leadtimes of the its outstanding orders. We consider the implications of this policy by developing expressions for the operating characteristics of the system...
-
作者：Wang, MY; Sethi, SP; VandeVelde, SL
作者单位：University of Toronto; University of Texas System; University of Texas Dallas; Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC
摘要：We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing first to a machine called the primary machine, then to a number of other machines in a fixed sequence, and finally back to the primary machine for its last operation. The problem is to schedule the jobs so as to minimize the makespan. This problem is unary NP-hard for a general number of machines. We focus in particular on the two-machine use that is also at least binary NP-hard. We prove some ...
-
作者：Nurani, RK; Seshadri, S; Shanthikumar, JG
作者单位：Carnegie Mellon University; New York University; University of California System; University of California Berkeley
摘要：We consider a single stage production system with Poisson demand and exponential processing times. After producing a good item, the production process can shift to an ''out-of-control'' state with a given probability and start producing bad items. The state of the process is known only when the next stage (or customer) receives the item. Once an out-of-control process is detected, process correction is instantaneous. Customers arriving to an empty system get backlogged. In this framework, we e...
-
作者：Stanford, DA
摘要：This paper presents new results for the interdeparture time distributions in single-server priority queues with an arbitrary number of high-priority Poisson-arrival classes and one lowest-priority general-arrival class. Little-known results for the waiting time distributions in the same queue are presented, including a new proof for the powerful result that the waiting time distribution in the non-preemptive priority queue is insensitive to the interarrival time distributions of lower-priority...
-
作者：Flynn, J; Garstka, S
作者单位：Yale University
摘要：Consider a single-item, periodic review, infinite-horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. Orders can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T periods, one observes the current stock level and orders deliveries for the next T periods, thus incurring a fixed setup cost. The goal is to find a review period T and an ordering policy that minimize the long...
-
作者：Korhonen, P; Salo, S; Steuer, RE
作者单位：University System of Georgia; University of Georgia
摘要：In this paper we further investigate the problem of finding nadir criterion values (minimum criterion values over the nondominated set) in multiple objective linear programming. Although easy to obtain, the minimum values present in a payoff table are unreliable and should only be used with caution, especially in problems that have more than a small number of extreme points. To obtain better estimates of the nadir criterion values without adding great complexity to the task, we present an appr...
-
作者：Pisinger, D
摘要：Several types of large-sized 0-1 Knapsack Problems (KP) may be easily solved, but in such cases most of the computational effort is used for sorting and reduction. In order to avoid this problem it has been proposed to solve the so-called core of the problem: a Knapsack Problem defined on a small subset of the variables. The exact core cannot, however, be identified before KP is solved to optimality, thus, previous algorithms had to rely on approximate core sizes. In this paper we present an a...
