A FEASIBILITY ALGORITHM FOR ONE-WAY SUBSTITUTION IN PROCESS ANALYSIS

Abstract

A certain number of machines are available, not all of the same capability, with which to do a certain number of tasks, varying in difficulty. On the assumption that it is better to use a more capable machine for a more difficult task, an algorithm is given for the most efficient assignment of machines to tasks. It is shown that the algorithm solves an equivalent linear programming problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 12, 1957
Accession Number
AD0605092

Entities

People

  • Kenneth J. Arrow
  • Selmer M. Johnson

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Counter IED

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Corporations
  • Evolutionary Algorithms
  • Heuristic Methods
  • Inequalities
  • Linear Programming
  • Mathematics
  • Microfiche
  • Notation
  • Photographic Materials
  • Photography
  • Simplex Method

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Neural Network Machine Learning.
  • Polymer Science and Engineering.