This dissertation addresses the problem of setting due dates to minimize completion inaccuracy penalties in a general job shop environment. In this simulation study, lateness penalties are generated by four defined functions: lateness variance, mean squared lateness, mean absolute lateness, and semi-quadratic lateness. Each of these functions assigns positive penalties to both early and late job completions.
The study proposes and demonstrates the benefits of an iterative simulation-regression procedure in determining allowance policies. Advantages of operation-based dispatching rules over job-based dispatching rules, as well as improvements to traditional methods of setting operation due dates, are demonstrated. Characteristics and benefits of incorporating shop congestion variables in due date setting procedures under different combinations of expected shop utilization and processing time assumptions are evaluated.
| Identifer | oai:union.ndltd.org:vcu.edu/oai:scholarscompass.vcu.edu:etd-5639 |
| Date | 01 January 1988 |
| Creators | Gee, Edward S. |
| Publisher | VCU Scholars Compass |
| Source Sets | Virginia Commonwealth University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | © The Author |
Page generated in 0.0078 seconds