Date of Award

9-1993

Document Type

Thesis

Degree Name

Master of Science

Abstract

This study examined the application of simple-to-use, low cost scheduling methods to the operating environment of a medium-sized manufacturing shop. Computer simulation was used to evaluate eighteen different scheduling algorithms, each the result of the combination of a loading and a sequencing rule; due date setting was not considered since due dates are exogenously set. The loading rules investigated were Minimum Machine Required, Lowest Average WIP, and Lowest Average Aggregate Priority Level. The sequencing rules investigated were Priority, EDD, FIS, SPT, Slack, and Slack Ratio. The scheduling algorithms were evaluated against performance measures of mean tardiness, mean flowtime, mean percentage of late jobs, and mean priority penalty. A repeated measures experimental design was used to evaluate each algorithm. Analysis of the results was accomplished using both two-factor ANOVA and Tukey all-pairwise multiple comparisons. This study produced results consistent with prior research in that it showed that with respect to shop performance, the choice of sequencing rule becomes less important as flexibility within the shop increases. The author concluded that for the operating environment of the manufacturing shop studied, the flexibility introduced into the shop by the selection of loading rule was the most significant factor in improving overall shop performance.

AFIT Designator

AFIT-GSM-LAL-93S-14

DTIC Accession Number

ADA273922

Comments

Presented to the Faculty of the School of Logistics and Acquisitions Management of the Air Force Institute of Technology

The authors' Vita pages are omitted.

Download

Share

COinS