Operations Research

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Stochastic Scheduling with Release Dates and Due Dates
Operations Research - Tập 31 Số 3 - Trang 559-572 - 1983
Yuqian Xu
We consider stochastic scheduling problems in which the processing times of jobs are independent exponentially distributed random variables, the release dates are random variables with an arbitrary joint distribution, and the due dates are random variables with a joint distribution that satisfies certain conditions. Our development establishes simple policies that minimize such criteria a...... hiện toàn bộ
Stochastic Network Interdiction
Operations Research - Tập 46 Số 2 - Trang 184-197 - 1998
Kelly J. Cormican, David P. Morton, R. Kevin Wood
Using limited assets, an interdictor attempts to destroy parts of a capacitated network through which an adversary will subsequently maximize flow. We formulate and solve a stochastic version of the interdictor's problem: Minimize the expected maximum flow through the network when interdiction successes are binary random variables. Extensions are made to handle uncertain arc capacities an...... hiện toàn bộ
Bounds on the Effect of Aggregating Variables in Linear Programs
Operations Research - Tập 28 Số 2 - Trang 403-418 - 1980
Paul Zipkin
This paper explores the effects of aggregating variables in large linear programs. We define a reasonable criterion for the resulting loss in accuracy, and derive bounds on this quantity. A posteriori bounds may be calculated after solving the aggregated problem, and a priori bounds before. Also, we show that standard iterative methods can be used to improve the accuracy of a given aggreg...... hiện toàn bộ
Jointly Optimal Inventory and Maintenance Policies for Stochastically Failing Equipment
Operations Research - Tập 16 Số 3 - Trang 587-601 - 1968
Charles H. Falkner
A dynamic programming problem is formulated to find the inventory, x, of a spare component and a sequence of maintenance intervals r= (r1,…,rx + 1) that minimize the expected cost of operating an equipment for a finite planning horizon, T. It is assumed that the component fails according to a life distribution function, F(⋯), with an increasing ha...... hiện toàn bộ
Traffic Dynamics: Studies in Car Following
Operations Research - Tập 6 Số 2 - Trang 165-184 - 1958
Robert E. Chandler, Robert K Herman, Elliott W. Montroll
The manner in which vehicles follow each other on a highway (without passing) and the propagation disturbances down a line of vehicles has been investigated. Experimental data is presented which indicates that the acceleration at time t of a car which is attempting to follow a leader is proportional to the difference in velocity of the two cars at a time (t − Δ), Δ being about 1.5 sec and...... hiện toàn bộ
Coordinating Clearance Markdown Sales of Seasonal Products in Retail Chains
Operations Research - Tập 46 Số 5 - Trang 609-624 - 1998
Gabriel R. Bitran, René Caldentey, Susana Mondschein
In this paper we propose a methodology to set prices of perishable items in the context of a retail chain with coordinated prices among its stores and compare its performance with actual practice in a real case study. We formulate a stochastic dynamic programming problem and develop heuristic solutions that approximate optimal solutions satisfactorily. To compare this methodology with cur...... hiện toàn bộ
Inventory Management of a Fast-Fashion Retail Network
Operations Research - Tập 58 Số 2 - Trang 257-273 - 2010
Felipe Caro, Jérémie Gallien
Working in collaboration with Spain-based retailer Zara, we address the problem of distributing, over time, a limited amount of inventory across all the stores in a fast-fashion retail network. Challenges specific to that environment include very short product life cycles, and store policies whereby an article is removed from display whenever one of its key sizes stocks out. To solve this...... hiện toàn bộ
Distribution Strategies that Minimize Transportation and Inventory Costs
Operations Research - Tập 33 Số 3 - Trang 469-490 - 1985
Lawrence D. Burns, Randolph W. Hall, Dennis E. Blumenfeld, Carlos F. Daganzo
This paper develops an analytic method for minimizing the cost of distributing freight by truck from a supplier to many customers. It derives formulas for transportation and inventory costs, and determines the optimal trade-off between these costs. The paper analyzes and compares two distribution strategies: direct shipping (i.e., shipping separate loads to each customer) and peddling (i....... hiện toàn bộ
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
Operations Research - Tập 46 Số 3 - Trang 330-335 - 1998
Michel Gendreau, Alain Hertz, Gilbert Laporte, Mihnea Stan
This article describes a generalized insertion heuristic for the Traveling Salesman Problem with Time Windows in which the objective is the minimization of travel times. The algorithm gradually builds a route by inserting at each step a vertex in its neighbourhood on the current route, and performing a local reoptimization. This is done while checking the feasibility of the remaining part...... hiện toàn bộ
Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
Operations Research - Tập 21 Số 1 - Trang 156-161 - 1973
Fred Glover, Eugene Woolsey
This paper gives rules that enable the transformation of a 0-1 polynomial programming problem into a 0-1 linear programming problem to be effected with reduced numbers of constraints. Rules are also given that provide reduced numbers of variables when the true variables of interest are not individual cross-product terms, but sums of such terms or polynomials of the form (∑xj
Tổng số: 154   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10