Showing papers in "Computers & Operations Research in 1983"

TL;DR: Fuzzy linear programming belongs to goal programming in the sense that implicitly or explicitly aspiration levels have to be defined at which the membership functions of the fuzzy sets reach their maximum or minimum.

TL;DR: This paper focuses on the development and testing of algorithms for solving the capacitated Chinese postman problem and extensive computational results are presented and analyzed.

TL;DR: This paper introduces the approach to generalized goal programming, describes its underlying philosophy, and indicates the specific subclass of models and methods which serve to comprise the overall approach.

TL;DR: A branch and bound algorithm is presented to obtain the optimal schedule that minimizes the maximum tardiness with minimum number of tardy jobs.

TL;DR: A consensus ranking function and several heuristics to solve the consensus ranking problem and empirical testing results of the solution strategies are presented to indicate their solution efficiency.

TL;DR: A multiobjective planning and resource allocation model is formulated to help identify “most effective” program-based disease/development intervention strategies and represents a first attempt to formally interface the major societal dimensions critical to control of parasitic diseases.

TL;DR: Results are presented which indicate that diets which are more nutritionally complete can be calculated in less time using this approach than through the classical manual methods.

TL;DR: Lexographic linear goal programming appears to provide an appropriate allocation methodology for academic and research library acquisitions funds, and is demonstrated by a sample model.

TL;DR: A new interactive goal-programming method is presented in which the constrained multiple-objectives problem is converted into a sequence of unconstrained single-objective problems and it is shown that under suitable conditions the method converges to a Pareto-optimum.

TL;DR: A 0–1 goal programming model is presented, based on an actual case example, for assigning projects to engineers in order to prevent project splitting and excessive manpower requirements, complete as many preferred projects as possible and maximize profits while keeping a balanced workload.

TL;DR: An explicit but approximate solution to the reorder point inventory model for lognormal lead time demand is developed and the same model under a constraint on fraction of demands backordered is obtained.

TL;DR: A numerical solution to multichannel queueing systems with ordered entry and finite or infinite source and bounds on the sizes of finite sources is presented.

TL;DR: Algorithms are presented which allow one to transform the sequential tableau into the multiphase tableau and vice versa and, in doing so, demonstrate the respective mathematical duals and their relationships.

TL;DR: The article demonstrates the applicability of Saaty's Analytical Hierarchy Process to the contestant ranking problem, which involves the ranking or seeding of contestants, each of whom has a previous won-loss record against the other contestants.

TL;DR: A goal programming model is applied to the problem in wage and salary administration of balancing internal concerns for equity against eternal market prices in the design of managerial compensation structures using an ideal point/Tchebycheff metric approach.

TL;DR: An application of goal programming to the multiple conflicting objectives of proponents and opponents of decentralization is presented, which analyzes the effect of a decision to decentralize on revenue to the central facility, the impact on staffing levels, theimpact on users remaining on thecentral facility after decentralization, and the level of computer resources available to the various users.

TL;DR: An efficient algorithm to obtain an improved initial feasible solution of a long transportation problem which saves 70–90% of simplex iterations executed by the “Most Negative Rule” as a basic change criteria is presented.

TL;DR: Using a Markov-Chain approach for computing the long-run expectations of the objectives it was demonstrated that the use of a stand-by mode for one of the conventional systems was optimal.

TL;DR: The algorithm, which is called the accelerated primal-dual algorithm (APDA), uses all-integer cutting planes and an advanced feasible start to speed convergence to optimality.

TL;DR: The method presented here differs from the exchange method in several important respects: it uses a “reduced basis” although determinants are used instead of finding an explicit basis inverse; and it develops a procedure for multiple pivots, or skipping extreme point solutions.

TL;DR: Results of this work confirms the possibility of utilizing the PIES algorithm concept as a model integration scheme in general network situations ingeneral network situations.

TL;DR: The compromise between beamwidth and side lobe level necessary in designing beam patterns is discussed, and an example of the application of Goal Programming to the selection of array shading coefficients is given.