Accession Number:

AD0786708

Title:

Branch-and-Bound and Heuristic Approaches to a Sequencing Problem with Team-Size Requirements,

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CALIF

Personal Author(s):

Report Date:

1974-01-01

Pagination or Media Count:

28.0

Abstract:

Most research in job shop scheduling has assumed that one machine is required for each operation. Some situations, however, require several machines of the same type. This is true, for example, in aircraft maintenance that requires teams of specialists the machines to fix a single malfunction. Because the study of the simplest scheduling problems, namely finite sequencing for a single machine, has provided valuable insights, the work described here was undertaken to examine the simplest type of static problem with variable team-size requirements.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE