Journal: Operations Research

Found 2096 papers in total
An interactive multiple criteria approach for parameter selection in metal cutting
An interactive multiple criteria approach for parameter selection in metal cutting
1989,
Many real-world problems, particularly in manufacturing planning, can be expressed as...
Using parallel iteration for approximate analysis of a multiple server queueing system
Using parallel iteration for approximate analysis of a multiple server queueing system
1989,
This paper describes an iterative approach to the analysis of Markovian service...
Comment on Yao and Buzacott’s ‘modeling a class of Flexible Manufacturing Systems with reversible routing’
Comment on Yao and Buzacott’s ‘modeling a class of Flexible Manufacturing Systems with reversible routing’
1989,
Recently, in an elegant paper, D.D. Yao and J.A. Buzacott argued that Jackson’s...
An interpolation approximation for the mean workload in a GI/G/1 queue
An interpolation approximation for the mean workload in a GI/G/1 queue
1989,
This paper develops a closed form approximation for the mean steady-state workload or...
Sensitivity analysis for simulations via likelihood ratios
Sensitivity analysis for simulations via likelihood ratios
1989,
The authors present a simple method of estimating the sensitivity of quantities...
Optimization by simulated annealing: An experimental evaluation; Part I, graph partitioning
Optimization by simulated annealing: An experimental evaluation; Part I, graph partitioning
1989,
In this and two companion papers, the authors report on an extended empirical study of...
Perspectives on parallel computing
Perspectives on parallel computing
1989,
Operations research is one problem domain that is likely to benefit from advances in...
Fast, effective algorithms for Simple Assembly Line Balancing problems
Fast, effective algorithms for Simple Assembly Line Balancing problems
1989,
A simple, fast and effective heuristic for the Simple Assembly Line Balancing Type I...
An exact algorithm for the Quadratic Assignment Problem on a tree
An exact algorithm for the Quadratic Assignment Problem on a tree
1989,
The Tree QAP is a special case of the Quadratic Assignment Problem (QAP) where the...
An efficient decision support system for academic course scheduling
An efficient decision support system for academic course scheduling
1989,
This paper describes a network-based decision support system approach to the most...
Selecting a portfolio of environmental programs for a synthetic fuels facility
Selecting a portfolio of environmental programs for a synthetic fuels facility
1989,
This article describes how a U.S. Department of Energy steering committee used a...
A dynamic Nash game model of oil market disruption and strategic stockpiling
A dynamic Nash game model of oil market disruption and strategic stockpiling
1989,
In this paper the authors present and analyze a Nash dynamic game model for...
Defense BEFORE or AFTER Bomb-Release-Line
Defense BEFORE or AFTER Bomb-Release-Line
1989,
The paper compares two alternative modes of defense against attacking aircraft:...
Dynamic network traffic assignment considered as a continuous time optimal control problem
Dynamic network traffic assignment considered as a continuous time optimal control problem
1989,
Two continuous time formulations of the dynamic traffic assignment problem are...
Axiomatic characterizations of the Raiffa and the Kalai-Smorodinsky Solutions to the Bargaining Problem
Axiomatic characterizations of the Raiffa and the Kalai-Smorodinsky Solutions to the Bargaining Problem
1989,
The Raiffa Solution to the Bargaining Problem, proposed in 1951, has several appealing...
A dual-ascent procedure for large-scale uncapacitated network design
A dual-ascent procedure for large-scale uncapacitated network design
1989,
The fixed-charge network design problem arises in a variety of problem contexts...
A fast and simple algorithm for the maximum flow problem
A fast and simple algorithm for the maximum flow problem
1989,
The authors present a simple sequential algorithm for the maximum flow problem on a...
Markov Decision Processes with sample path constraints: The communicating case
Markov Decision Processes with sample path constraints: The communicating case
1989,
The authors consider time-average Markov Decision Processes (MDPs), which accumulate a...
Solution procedures for partially observed Markov decision processes
Solution procedures for partially observed Markov decision processes
1989,
The authors present three algorithms to solve the infinite horizon, expected...
On the complexity of scheduling with batch setup times
On the complexity of scheduling with batch setup times
1989,
Many practical scheduling problems involve processing several batches of related jobs...
Generalized dynamic programming for stochastic combinatorial optimization
Generalized dynamic programming for stochastic combinatorial optimization
1989,
In stochastic versions of combinatorial optimization problems, the objective is to...
Sequencing in an assembly line with blocking to minimize cycle time
Sequencing in an assembly line with blocking to minimize cycle time
1989,
The authors consider an assembly line with m stations in series having finite capacity...
Single machine scheduling with controllable processing times and number of jobs tardy
Single machine scheduling with controllable processing times and number of jobs tardy
1989,
Most scheduling research has treated individual job processing times as fixed...
Disposal of excess inventory
Disposal of excess inventory
1989,
This paper deals with the problem of disposal of slow-moving or obsolete inventory....
Papers per page: