Engineering topics

Dupnick, E.

Publications and source records attributed to Dupnick, E..

4 records

NASA NTRS1980

Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE). Volume 1: User's guide

An interactive computer program for automatically generating traffic models for the Space Transportation System (STS) is presented. Information concerning run stream construction, input data, and output data is provided. The flow of the interactive data stream is described. Error messages are specified, along with suggestions for remedial action. In addition, formats and parameter definitions for the payload data set (payload model), feasible combination file, and traffic model are documented.

Dupnick, E.↗

NASA NTRS1980

Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE). Volume 2: Mission payloads subsystem description

The scheduling algorithm for mission planning and logistics evaluation (SAMPLE) is presented. Two major subsystems are included: The mission payloads program; and the set covering program. Formats and parameter definitions for the payload data set (payload model), feasible combination file, and traffic model are documented.

Dupnick, E.↗

NASA NTRS1980

Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE). Volume 3: The GREEDY algorithm

The functional specifications, functional design and flow, and the program logic of the GREEDY computer program are described. The GREEDY program is a submodule of the Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE) program and has been designed as a continuation of the shuttle Mission Payloads (MPLS) program. The MPLS uses input payload data to form a set of feasible payload combinations; from these, GREEDY selects a subset of combinations (a traffic model) so all payloads can be included without redundancy. The program also provides the user a tutorial option so that he can choose an alternate traffic model in case a particular traffic model is unacceptable.

Dupnick, E.↗

NASA NTRS1973

A vehicle scheduling algorithm using non-serial discrete dynamic programming with space shuttle applications

Description of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.

Dupnick, E.↗