Class scheduling algorithms for Navy training schools -- Web of Science 5.0

Easy Search Results--Full Record

Article 4 of 6

Explanation

Class scheduling algorithms for Navy training schools
Apte A, Jayasuriya A, Kennington J, Krass I, Mohamed R, Sorensen S, Whitler J
NAVAL RESEARCH LOGISTICS 45 (6): 533-551 SEP 1998

Document type: Article

Language: English

Cited References: 18

Times Cited: 0

Abstract:
The problem of developing good schedules for Navy C-Schools has been modeled as a combinatorial optimization problem. The only complicating feature of the problem is that classes must be grouped together into sequences known as pipelines. An ideal schedule will have all classes in a pipeline scheduled in consecutive weeks. The objective is to eliminate the nonproductive time spent by sailors at C-Schools who are waiting for the next class in a pipeline. In this investigation an implicit enumeration procedure for this problem was developed. The key component of our algorithm is a specialized greedy algorithm which is used to obtain a good initial incumbent. Often this initial incumbent is either an optimal schedule or a near optimal schedule. In an empirical analysis with the only other competing software system, our greedy heuristic found equivalent or better solutions in substantially less computer time. This greedy heuristic was extended and modified for the A-School scheduling problem and aias found to be superior to its only competitor. (C) 1998 John Wiley & Sons, Inc.

KeyWords Plus:
TRAVELING SALESMAN PROBLEM, OPTIMIZATION

Addresses:
Kennington J, So Methodist Univ, Dept Comp Sci & Engn, Dallas, TX 75275 USA
So Methodist Univ, Dept Comp Sci & Engn, Dallas, TX 75275 USA
Defense Manpower Data Ctr, Monterey, CA 93490 USA
Cairo Univ, Cairo, Egypt
USN, Ctr Personnel Res & Dev, San Diego, CA 92152 USA

Publisher:
JOHN WILEY & SONS INC, NEW YORK

IDS Number:
111GA

ISSN:
0894-069X

Article 4 of 6

Acceptable Use Policy