An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times

One of 5,117 reports in the series: Atomic Energy Commission Reports available on this site.
Thumbnail image of item number 1 in: 'An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times'.
Thumbnail image of item number 2 in: 'An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times'.
Thumbnail image of item number 3 in: 'An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times'.
Thumbnail image of item number 4 in: 'An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times'.
Showing 1-4 of 29 pages in this report.

PDF Version Also Available for Download.

Description

"An algorithm for the generation of feasible schedules and the computation of the completion times of the job operations of feasible schedule is presented. Using this algorithm, the distribution of schedule times over the set of feasible schedule—or a subset of feasible schedules—was determined for technological orderings that could occur in a general machine shop. These distributions are found to be approximately normal. Biasing techniques corresponding to “first come first serve,” random choice of jobs ready at each machine and combinations of these two extremes were used to compute distributions of schedule times."

Physical Description

30 pages : illustrations, tables

Creation Information

Heller, Jack & Logemann, George November 15, 1960.

Context

This report is part of the collection entitled: TRAIL Microcard Collection and was provided by the UNT Libraries Government Documents Department to the UNT Digital Library, a digital repository hosted by the UNT Libraries. More information about this report can be viewed below.

Who

People and organizations associated with either the creation of this report or its content.

Authors

Originator

Sponsor

Publisher

Audiences

We've identified this report as a primary source within our collections. Researchers, educators, and students may find this report useful in their work.

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

About | Browse this Partner

Contact Us

Corrections Questions

What

Descriptive information to help identify this report. Follow the links below to find similar items on the Digital Library.

Titles

Description

"An algorithm for the generation of feasible schedules and the computation of the completion times of the job operations of feasible schedule is presented. Using this algorithm, the distribution of schedule times over the set of feasible schedule—or a subset of feasible schedules—was determined for technological orderings that could occur in a general machine shop. These distributions are found to be approximately normal. Biasing techniques corresponding to “first come first serve,” random choice of jobs ready at each machine and combinations of these two extremes were used to compute distributions of schedule times."

Physical Description

30 pages : illustrations, tables

Notes

Digitized from microopaque cards (1).

Includes bibliographical references (page 20).

Subjects

Library of Congress Subject Headings

Language

Item Type

Identifier

Unique identifying numbers for this report in the Digital Library or other systems.

  • OCLC: #
  • SuDoc Number: Y 3.At 7:22/NYO-9488
  • Report No.: NYO-9488
  • Accession or Local Control No: metadc1463616
  • Archival Resource Key: ark:/67531/metadc1463616

Collections

This report is part of the following collections of related materials.

TRAIL Microcard Collection

Imaged from microcard, these technical reports describe research performed for U.S. government agencies from the 1930s to the 1960s. The reports were provided by the Technical Report Archive and Image Library (TRAIL).

About | Browse this Collection

Technical Report Archive and Image Library

The Technical Report Archive & Image Library (TRAIL) identifies, acquires, catalogs, digitizes and provides unrestricted access to U.S. government agency technical reports. The mission of TRAIL is to ensure preservation, discoverability, and persistent open access to government technical publications regardless of form or format.

About | Browse this Collection

What responsibilities do I have when using this report?

Digital Files

When

Dates and time periods associated with this report.

Creation Date

  • November 15, 1960

Added to The UNT Digital Library

  • Sept. 2, 2021, 4:32 p.m.

Description Last Updated

  • Aug. 21, 2023, 3:48 p.m.

Usage Statistics

When was this report last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 4
More Statistics

Where

Geographical information about where this report originated or about its content.

Place Name

Publication Place

Map Information

  • map marker Place Name coordinates. (May be approximate.)
  • Repositioning map may be required for optimal printing.

Mapped Locations

Interact With This Report

Here are some suggestions for what to do next.

Start Reading

Thumbnail image of item number 1 in: 'An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times'.
Thumbnail image of item number 2 in: 'An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times'.
Thumbnail image of item number 3 in: 'An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times'.
Thumbnail image of item number 4 in: 'An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times'.

PDF Version Also Available for Download.

Citations, Rights, Re-Use

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Links for Robots

Helpful links in machine-readable formats.

Archival Resource Key (ARK)

International Image Interoperability Framework (IIIF)

Metadata Formats

Images

URLs

Stats

Heller, Jack & Logemann, George. An Algorithm for Construction Feasible Schedules and Computing Their Schedule Times, report, November 15, 1960; Washington D.C.. (https://digital.library.unt.edu/ark:/67531/metadc1463616/: accessed December 9, 2023), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; crediting UNT Libraries Government Documents Department.

Back to Top of Screen