Scheduling and labour-assignment policies for a dual-constrained repair shop†

Partially supported by the Minnesota Supercomputer Institute.

SUMMARY

Priority-scheduling rules and labour-assignment policies are presented for a repair shop which supports a multiple-item repairable-inventory system with a hierarchical product structure. Results from earlier research are extended to machine- and labour-limited environments. Several scheduling rules, combined with two labour-assignment policies and two levels of labour-transfer control, are evaluated using a simulation model. The results indicate that the better priority scheduling rules in the machine-limited situation are also good in the dual-constrained situation. In addition, the better labour-assignment policy is shown to be a function of how often workers are available for reassignment.

Notes

Partially supported by the Minnesota Supercomputer Institute.