M JOB - ONE MACHINE SEQUENCING PROBLEM.

Abstract

The M job one machine sequencing problem is solved by use of J. M. Moore's 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)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1969
Accession Number
AD0688046

Entities

People

  • Irwin F. Goodman

Organizations

  • Tank-automotive and Armaments Command

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programs
  • Computers
  • Language
  • Scheduling (Production)
  • Terminals

Fields of Study

  • Computer science

Readers

  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Operations Research
  • Parallel and Distributed Computing.