1. |
Communication Skills: Information-Seeking Interviews |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 883-890
CharlesDavid,
FleetwoodPat,
LuckMichael,
Preview
|
PDF (4022KB)
|
|
摘要:
AbstractCommunication with managers is important throughout every O.R. project, and information-seeking interviews are especially important. Yet the subject of communication has not been studied scientifically in O.R. This paper describes efforts to develop interview skills within a module on communication in an M.Sc. course. The interview skills component of the module consists of three phases in the university, followed by a fourth phase when the students carry out interviews in a real organization as part of the M.Sc. project. Some analysis has been made of processing skills in interviewing where language assistance given to overseas students was turned to account with British students.
ISSN:0160-5682
DOI:10.1057/jors.1985.158
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|
2. |
Gilt-Edged Switching and Markov Decision Processes |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 891-902
AdelsonR. M.,
Preview
|
PDF (5434KB)
|
|
摘要:
AbstractA model for switching between gilt-edged securities is developed using a modified version of Howard's Markov decision algorithm. The model makes use of empirical observations of the behaviour of relative price movements. It produced some interesting results in the theory of Markov decision processes, and empirical tests of methods of implementation, which allow for constraints not included in the formal model, showed very promising results.
ISSN:0160-5682
DOI:10.1057/jors.1985.159
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|
3. |
A Microcomputer Based Solution to a Practical Scheduling Problem |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 903-914
HodsonA.,
MuhlemannA. P.,
PriceD. H. R.,
Preview
|
PDF (4324KB)
|
|
摘要:
AbstractThis paper presents a scheduling problem with constraints imposed on the waiting time between stages. The process in which it occurs involves the preparation, cooking and chilling of meals. A maximum of 30 min is permitted for waiting between the completion of the cooking stage and the start of chilling down to temperature of<3°C. If this is not achieved, then the food has to be discarded. Clearly the scheduling of the final cooking stage and chilling facilities is crucial in this context. The development of a procedure to do this scheduling, using a microcomputer, is described and some typical results presented. Further uses of the model are briefly outlined.
ISSN:0160-5682
DOI:10.1057/jors.1985.160
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|
4. |
Problems in Determining Bidding Strategies |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 915-923
KingMalcolm,
MercerAlan,
Preview
|
PDF (4816KB)
|
|
摘要:
AbstractA methodology for estimating the bidding strategy of a collaborating company in an apparently complex market, as exemplified by a heating and ventilating contractor, has been developed. In the absence of sufficient detailed price data on all identified competitors, the market lowest bid strategy was determined sufficiently accurately to allow possible strategy changes to be simulated.
ISSN:0160-5682
DOI:10.1057/jors.1985.161
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|
5. |
Emptying Current-Account Buffers |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 925-928
PefferR. A.,
RijvordtJ. D.,
TelgenJ.,
Preview
|
PDF (2340KB)
|
|
摘要:
AbstractRabobank is one of the largest banks in The Netherlands and ranks among the 50 largest banks in the world, with over 4 million current accounts. Normally customers receive statements on their accounts only when a certain buffer of changes, both payments and receipts, is filled up. At the end of the year, fiscal and administrative requirements are such that all buffers should be empty. Because of cost and service considerations as well as capacity limitations, all current-account buffers cannot be emptied at will or at the same time. The problem of when to empty current-account buffers can be modelled as a (surprisingly simple) integer-programming problem. Then the problem can be solved easily for a number of different situations, yielding substantial improvements. In this paper, the application of this model to the Rabobank situation at the end of 1983 is described in detail.
ISSN:0160-5682
DOI:10.1057/jors.1985.162
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|
6. |
Allocation of Resources to Depots |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 929-933
EinbuJohn M.,
Preview
|
PDF (2811KB)
|
|
摘要:
AbstractIn the literature on resource allocation problems, attention is predominantly focused on how to allocate fixed reservoirs of resources (depot stockpiles) to given activities. Comparatively few papers deal with the initial assignment of resources to the depots. This paper is concerned with the establishment of depot stockpiles, the replenishment of depots, and the policy to follow when resources are allocated to activities from several, but virtually unlimited, depot stockpiles. An algorithm is provided for the solution of some of the problems ensuing from the discussion.
ISSN:0160-5682
DOI:10.1057/jors.1985.163
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|
7. |
Mixed-Integer Linear-Programming Formulation of a Multi-Attribute Threshold Model of Choice |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 935-942
MustafiC. K.,
XavierM. J.,
Preview
|
PDF (2815KB)
|
|
摘要:
AbstractThis article presents a mixed-integer linear-programming formulation and solution of the multi-attribute threshold model of choice. The model includes appropriate integer decision variables so that the solution would indicate whether a particular alternative of choice is acceptable or not. The technique is illustrated by a numerical example.
ISSN:0160-5682
DOI:10.1057/jors.1985.164
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|
8. |
The Tolerance Approach to Sensitivity Analysis of Matrix Coefficients in Linear Programming: General Perturbations |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 943-950
RaviN.,
WendellRichard E.,
Preview
|
PDF (3057KB)
|
|
摘要:
AbstractIn the tolerance approach to sensitivity analysis of matrix coefficients in a linear programme, the maximum tolerance percentage characterizes the largest percentage within which selected matrix coefficients may vary simultaneously and independently while retaining the same set of optimal basic variables. While it is difficult to calculate exactly the maximum tolerance percentage under perturbations in multiple rows or columns, we show herein how it can be approximated.
ISSN:0160-5682
DOI:10.1057/jors.1985.165
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|
9. |
Integration of Auditor Preferences and Sampling Objectives: A Polynomial Goal-Programming Perspective |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 951-957
TayiGiri Kumar,
GangollyJagdish,
Preview
|
PDF (3648KB)
|
|
摘要:
AbstractThe choice of an audit sample involves integration of diverse goals. Such integration must consider the preferences of the auditor towards costs as well as risks. Traditionally this problem has been formulated to determine minimal sample size and its allocation such that each of the goals is satisfied simultaneously or to the extent possible. However, these formulations do not consider trade-offs between goals, so that the sample may not reflect the auditor's preferences regarding sampling costs and risks. In this paper, we model such trade-offs by utilizing a polynomial goal-programming framework and utilize a practical case problem to illustrate the framework. Computational experience shows the technique to be feasible and inexpensive.
ISSN:0160-5682
DOI:10.1057/jors.1985.166
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|
10. |
Randomized Decisions in Chance-Constrained Programming |
|
Journal of the Operational Research Society,
Volume 36,
Issue 10,
1985,
Page 959-962
KnottM.,
Preview
|
PDF (1636KB)
|
|
摘要:
AbstractBhattacharyya and Mukherjee have both considered a particular joint randomized decision problem in chance-constrained programming. This paper shows a general approach for solving a large class of similar problems.
ISSN:0160-5682
DOI:10.1057/jors.1985.167
出版商:Taylor&Francis
年代:1985
数据来源: Taylor
|