A FEASIBILITY ALGORITHM FOR ONE-WAY SUBSTITUTION IN PROCESS ANALYSIS
RAND CORP SANTA MONICA CA
Pagination or Media Count:
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.
- Operations Research