A feasibility algorithm for One-Way Substitution in process analysis.
Published 12 September 1957
Kenneth J. Arrow, Selmer Martin Johnson
Citations2
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that the algorithm given for the most efficient assignment of machines to tasks solves an equivalent linear programming problem.
Abstract
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.
Keywords
EngineeringBusiness, Management and Accounting