ISSN:0160-5682    

DOI:10.1057/jors.1986.1

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1986.2

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor

摘要:

AbstractA brief outline of A.I. is provided, noting problems, techniques and objectives which are similar to those found in O.R. It is intended that this will indicate to O.R. workers which A.I. areas might be worth following up as relevant to their own work and which problems in A.I. might be attacked by the O.R. community as part of the development of intelligent support systems.

ISSN:0160-5682    

DOI:10.1057/jors.1986.3

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor

摘要:

AbstractThis article describes the methods which form the basis of contemporary automatic speech recognition systems. The two most prominent algorithms, dynamic time-warping and hidden Markov modelling, are described and compared. Particular attention is given to the role of dynamic programming in either approach.

ISSN:0160-5682    

DOI:10.1057/jors.1986.4

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor

摘要:

AbstractTwo problems in image processing are presented: chromosome classification and the construction of cross-sectional images from non-cross-sectional views. Both problems are formulated as network flow models, a type of model generally found in the O.R. setting. This shows the applicability of such O.R. techniques to problems of intelligent information processing.

ISSN:0160-5682    

DOI:10.1057/jors.1986.5

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor

摘要:

AbstractThis paper presents a problem in pattern recognition and formulates it in terms of a dynamic-programming model. Although dynamic programming is usually thought of as an O.R. tool applied to management problems, this paper shows that it has natural applications in pattern matching and recognition, developing aspects of fifth generation computing technology.

ISSN:0160-5682    

DOI:10.1057/jors.1986.6

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor

摘要:

AbstractThis paper compares operational research (O.R.) with the currently fashionable topic of artificial intelligence (A.I.) at a detailed level. A.I. concepts, techniques and history are summarized, and O.R. and A.I. approaches compared. A case study-the development of a potential aid to scheduling repair jobs on RAF squadrons—is described. The paper shows where A.I. concepts and techniques were used in the prototype program, known as the Fault Identification&Expediting Repair (FIXER) system. Finally, some lessons for O.R. are drawn.

ISSN:0160-5682    

DOI:10.1057/jors.1986.7

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor

摘要:

AbstractAs universities react to severe financial pressures, there is a danger that too much emphasis will be placed on‘balancing the budget’at the expense of the academic goals of the institution. Therefore, the overall objective of this paper is to design and implement a model for reducing the operating budgets of the academic units of a university, while reflecting the diverse goals of the academic community. It recognizes that faculty, department chairmen and deans should share the responsibility of‘reverse’resource allocations or budget reductions. The model utilizes a goal-programming approach to reflect the multiple-phased model to allow for some degree of decentralization of decision making.The model is applied to a small private university. The solution to the model reveals the distribution of budget reductions among the schools and within the departments. A survey of potential users reveals a definite preference for the model results over the actual budget procedure.

ISSN:0160-5682    

DOI:10.1057/jors.1986.8

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor

摘要:

AbstractThis paper presents two algorithms for scheduling security guards in a large organization in Israel. The scheduling plan must meet three main objectives: to satisfy the number of guards required for each shift as much as possible; to satisfy the guards' requests for vacations as much as possible; and to satisfy the periodic training needs of the guards as much as possible. There is priority order among these three objectives in the order they are stated above.The paper first provides a description of the guarding system constraints and requirements. Then follows a mathematical formulation of this multi-objective problem and a procedure for finding the optimal solution to it. A simpler heuristic intuitive algorithm was developed and computerized. Finally, a summary and conclusions are given.

ISSN:0160-5682    

DOI:10.1057/jors.1986.9

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor

摘要:

AbstractThe order quantity which minimizes discounted cash flows for a one-time-only sale is determined. Current inventory may be at or exceed the usual reorder point when the sale is consummated. In the latter case, the company may decide to buy nothing, especially if a large minimum order quantity is required in order to obtain the price discount. The same model can also be used to handle the case of an impending price increase. Exact and approximate solutions are presented which recommend the order quantity, the associated cost savings, minimum acceptable percentage price discount and minimum vendor quantity requirements.

ISSN:0160-5682    

DOI:10.1057/jors.1986.10

出版商:Taylor&Francis    

年代:1986

数据来源: Taylor