Developed in this thesis is a simulation model for loading schedules in die manufacturing process. The existing analytic and heuristic techniques for the loading schedules are generally limited in scope and applicability.
Subcontract, alternative resource combinations ( ARC ), machine overtime, and fixed activities ( i.e. activities which cannot be changed in rescheduling. ) are taken into consideration for the real manufacturing situation. From these considerations, this model can identify machine loading schedules which take prevent from maximum tardiness of high priority die.
The activity's latest start time ( i.e.remaining processing time ) is considered as a dispatching rules in this model. The Gantt Chart which takes the loading schedules from the main program is provided.
A simulation program is written in FORTRAN 77 to be run on an IBM PC/AT. An example illustrates the application of the model.
