No description available.

The generation and maintenance of feasible schedules for Navy training courses are labor intensive throughout the Naval Education and Training Command. The major constraints affecting this scheduling are planned input requirements and the suitability/availability of instructors, equipment, and facilities. An additional constraint is that schedules must be established for the current year, updated and revised as necessary, and projected for the out-year planning requirements of the 5-Year Defense Plan. This thesis documents the essential components of scheduling for training at a representative training center, the Fleet Anti-Submarine Warfare Training Center, Pacific. It provides details for the automation of the current scheduling process, with a limited demonstration for a sample of courses. Conclusions and recommendations for the development of an automated optimal scheduling system are presented.

published_or_final_version / Industrial and Manufacturing Systems Engineering / Doctoral / Doctor of Philosophy

Not available / text

Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 119-128). Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 117-118). Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 119-128). Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 117-118). Also available on the Internet.

published_or_final_version / Industrial and Manufacturing Systems Engineering / Doctoral / Doctor of Philosophy

A research project submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in partial fulfillment of the requirements for the degree of Master of Science. / The problem of scheduling with sequence-dependent set-up times in a dynamic environment is investigated by studying how various dispatching rules perform when used to schedule two cranes. Motivated by a practical scheduling problem, the effect on production by delays due to the conflicts that result between cranes is examined. The problem is formalized, and it is shown that it can be classified as a problem of scheduling with both sequence-dependent set-up and processing times. The effectiveness of simple dispatching procedures that are used in machine scheduling and for the control of automated guided vehicles is studied, using a simulation of a crane aisle with jobs arriving dynamically. In addition, a dispatching rule, which explicitly uses information regarding the state of the second crane, is examined. The simulation results confirm the non-dominance of certain dispatching procedures, and show how performance is improved as the rules are provided more information regarding the state of the scheduling environment. It is shown that when there are sequence-dependent processing times, a scheduling heuristic that uses global information does significantly better than more commonly used local heuristics. / AC2017