M JOB - ONE MACHINE SEQUENCING PROBLEM.
ARMY TANK AUTOMOTIVE COMMAND WARREN MICH
Pagination or Media Count:
The M job one machine sequencing problem is solved by use of J. M. Moores Algorithm. The Algorithm has been programmed in Basic language on a computer time sharing terminal. An example of a computer run along with the computer program and flow diagram are included. This effort was accomplished in support of a currently larger effort concerning the scheduling of jobs on a computer. Author
- Computer Programming and Software
- Computer Systems