Branch-and-Bound and Heuristic Approaches to a Sequencing Problem with Team-Size Requirements,
RAND CORP SANTA MONICA CALIF
Pagination or Media Count:
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.
- Operations Research