Abstract
A bi-criterion priority rule for minimizing machine interference and reducing job waiting time in the case of two semiautomatic machines sharing the same server for loading-unloading purposes is presented. It is shown that the interference resulting from scheduling a job is a function of the total processing time (including loading-unloading time) of the last job scheduled on the other machine minus the total processing time of the job currently under consideration. The resulting algorithm selects as the next job to be processed the one with the smallest total processing time resulting in no interference. If there is no such a job, machine interference is minimized by selecting as the next job to be processed the one with the longest total processing time among all jobs waiting for the machine. It is shown that the algorithm is highly effective in situations where machines and server are highly utilized.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
