Accession Number : AD0786708
Title : Branch-and-Bound and Heuristic Approaches to a Sequencing Problem with Team-Size Requirements,
Corporate Author : RAND CORP SANTA MONICA CALIF
Personal Author(s) : Miller,Louis W.
Report Date : JAN 1974
Pagination or Media Count : 28
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.
Descriptors : *Jobs, *Scheduling, Network flows, Heuristic methods, Mathematical logic, Computations
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE