Rules for scheduling semi-automatic machines with deterministic cycle time

Publisher Website
Google Scholar
Abstract
A considerable amount of research has been conducted into the use of decision rules for scheduling in the job-shop environment. The research discussed in this paper is of a similar nature but concerned with the use of rules for controlling the service operation to semi-automatic machines where, the. run times and service times are, in the main, deterministic. The set of rules studied is different to those of the job-shop scheduling problem since the. products are manufactured, under batch conditions. Producing for stock means that delivering dates are not important but the idle time of machines is very important. The behaviour of a set of ten rules is studied and their performance measured by four different, but reasonable, criteria. The results of the study indicate that under most conditions and measured by several, but not all, of the criteria used, the rule serve the machine, awaiting service with shortest required service time, performs best. That is the conclusion is similar to the job-shop studies where the S10 rule is successful.

This publication has 0 references indexed in Scilit: