Title :
Optimal dispatching of two-priority job streams to two nonidentical machines
Author :
Zhou, MengChu ; Mirchandani, Pitu B.
Author_Institution :
Dept. of Electr., Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA
Abstract :
The following control problem in manufacturing is addressed. Jobs of two priority classes, C1 and C2, arrive at a system with two non-identical machines. Class C1 jobs with higher priority have dispatch preference over C2 jobs with lower priority. The problem is to dispatch appropriate fractions of class C1 jobs to machines 1 and 2 so that the average flow time of C1 jobs is minimized and neither C1 jobs nor C2 jobs are lost. The analytical solution to the problem is derived for various system disciplines, including: nonpreemptive priorities, preemptive priorities with resumption, preemptive priorities with resumption and setup and nonpreemptive priorities with multiple vacations
Keywords :
industrial control; optimisation; production control; scheduling; analytical solution; average flow time; dispatch preference; multiple vacations; nonpreemptive priorities; preemptive priorities; priority classes; resumption; setup; system disciplines; two-priority job streams; Buffer storage; Computer aided manufacturing; Control systems; Dispatching; Job shop scheduling; Printers; Processor scheduling; Pulp manufacturing; Single machine scheduling; Systems engineering and theory;
Conference_Titel :
Intelligent Control, 1989. Proceedings., IEEE International Symposium on
Conference_Location :
Albany, NY
Print_ISBN :
0-8186-1987-2
DOI :
10.1109/ISIC.1989.238705
