Procedures for Heuristic Scheduling under Limited Resources in Activity Networks.

Abstract

This is the documentation of a program that permits the analyst to choose any one of three priority rules of schedule activities under conditions of limited resources. The program is written in FORTRAN. We give the logic of the programs, a flowchart representation, and a printout of the instructions (upon request). Also, a solved sample problem is included. This program is available at a nominal fee from the Graduate Program in Operations Research, NC State University, PO Box 5511, Raleigh, NC 27650. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1981
Accession Number
ADA103638

Entities

People

  • S. E. Elmaghraby
  • Z. M. Naman

Organizations

  • North Carolina State University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Assembly
  • Assembly Lines
  • Availability
  • Computers
  • Containers
  • Generators
  • Iterations
  • Job Shop Scheduling
  • New York
  • North Carolina
  • Operations Research
  • Random Number Generators
  • Reliability
  • Scheduling (Production)
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Operations Research
  • Research Science/Academic Research