NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
An algorithm for a single machine scheduling problem with sequence dependent setup times and scheduling windowsAn enumeration algorithm is presented for solving a scheduling problem similar to the single machine job shop problem with sequence dependent setup times. The scheduling problem differs from the job shop problem in two ways. First, its objective is to select an optimum subset of the available tasks to be performed during a fixed period of time. Secondly, each task scheduled is constrained to occur within its particular scheduling window. The algorithm is currently being used to develop typical observational timelines for a telescope that will be operated in earth orbit. Computational times associated with timeline development are presented.
Document ID
19760029665
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Moore, J. E.
(NASA Marshall Space Flight Center Systems Analysis Group, Huntsville, Ala., United States)
Date Acquired
August 8, 2013
Publication Date
March 1, 1975
Publication Information
Publication: AIIE Transactions
Subject Category
Computer Programming And Software
Accession Number
76A12631
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available