-
作者：Jahn, O; Möhring, RH; Schulz, AS; Stier-Moses, NE
作者单位：Technical University of Berlin; Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT); Columbia University
摘要：The design of route guidance systems faces a well-known dilemma. The approach that theoretically yields the system-optimal traffic pattern may discriminate against some users in favor of others. Proposed alternate models, however, do not directly address the system perspective and may result in inferior performance. We propose a novel model and corresponding algorithms to resolve this dilemma. We present computational results on real-world instances and compare the new approach with the well-e...
-
作者：Savin, SV; Cohen, MA; Gans, N; Katalan, Z
作者单位：Columbia University; University of Pennsylvania
摘要：We consider the allocation of capacity in a system in which rental equipment is accessed by two classes of customers. We formulate the problem as a continuous-time analogue of the one-shot allocation problems found in the more traditional literature on revenue management, and we analyze a queueing control model that approximates its dynamics. Our investigation yields three sets of results. First, we use dynamic programming to characterize properties of optimal capacity allocation policies. We ...
-
作者：Elhallaoui, I; Villeneuve, D
作者单位：Universite de Montreal; Polytechnique Montreal; Universite de Montreal
摘要：Column generation is often used to solve problems involving set-partitioning constraints, such as vehicle-routing and crew-scheduling problems. When these constraints are in large numbers and the columns have on average more than 8-12 nonzero elements, column generation often becomes inefficient because solving the master problem requires very long solution times at each iteration due to high degeneracy. To overcome this difficulty, we introduce a dynamic constraint aggregation method that red...
-
作者：Murphy, FH; Smeers, Y
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); Temple University; Universite Catholique Louvain; Universite Catholique Louvain
摘要：We consider three models of investments in generation capacity in restructured electricity systems that differ with respect to their underlying economic assumptions. The first model assumes a perfect, competitive equilibrium. It is very similar to the traditional capacity expansion models even if its economic interpretation is different. The second model (open-loop Cournot game) extends the Cournot model to include investments in new generation capacities. This model can be interpreted as desc...
-
作者：Huang, B; Iravani, SMR
作者单位：Northwestern University
摘要：We consider a supply chain consisting of one manufacturer (capacitated supplier) and two retailers. We characterize the manufacturer's optimal production policy under selective-information sharing, in which the manufacturer receives demand and inventory information from only one of the two retailers. We show that the manufacturer's optimal production policy is a state-dependent base-stock policy and that the base-stock levels have a monotonic structure. We also perform an extensive numerical s...
-
作者：Eisenstein, DD
作者单位：University of Chicago
摘要：We consider facilities that follow a cyclic schedule to replenish the inventory of a set of items through production by a shared resource. We introduce a dynamic produce-up-to policy that recovers the target cyclic schedule after a single disruption, and is also shown to be effective when disruptions are more frequent. Our policy is more flexible than traditional recovery policies in that our policy is able to adjust the amount of idle time observed during recovery in response to disruptions, ...
-
作者：Gal, S; Howard, JV
作者单位：University of Haifa; University of London; London School Economics & Political Science
摘要：An agent (who may or may not want to be found) is located in one of two boxes. At time 0 suppose that he is in box B. With probability p he wishes to be found, in which case he has been asked to stay in box B. With probability 1 - p he tries to evade the searcher, in which case he may move between boxes A and B. The searcher looks into one of the boxes at times 1, 2, 3,.... Between each search the agent may change boxes if he wants. The searcher is trying to minimise the expected time to disco...
-
作者：Hum, SH; Sharafali, M; Teo, CP
作者单位：National University of Singapore; University of Melbourne; Sungkyunkwan University (SKKU); National University of Singapore
摘要：The delivery scheduling problem studied in this paper was motivated by the operation in a large personal computer assembly plant, which was using multisourcing for some of its materials. The company's objective was to design a delivery schedule so that the average inventory level in the factory was minimized. We show that the problem is intimately related to a classical inventory staggering problem, where the focus is on the computation of the peak inventory level associated with the replenish...
-
作者：Atamtürk, A; Küçükyavuz, S
作者单位：University of California System; University of California Berkeley
摘要：We investigate the polyhedral structure of the lot-sizing problem with inventory bounds. We consider two models, one with linear cost on inventory, the other with linear and fixed costs on inventory. For both models, we identify facet-defining inequalities that make use of the inventory bounds explicitly and give exact separation algorithms. We also describe a linear programming formulation of the problem when the order and inventory costs satisfy the Wagner-Whitin nonspeculative property. We ...
-
作者：Lim, A; Rodrigues, B
作者单位：Hong Kong University of Science & Technology; Singapore Management University
摘要：Huang et al. (2003) used the Cesaro limit of a savings function to determine the optimal special order in an EOQ model with single announced price increases over an infinite horizon. In this note, we point out that the savings function is not Cesaro summable. More importantly, no limiting argument for the cost function d(t, Q(s)) as t -> infinity is necessary at all given that this function is periodic for which it suffices to optimize the integral of the function over any given period.
