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

fYear

1989

fDate

25-26 Sep 1989

Firstpage

138

Lastpage

143

Abstract

The following control problem in manufacturing is addressed. Jobs of two priority classes, C₁ and C₂, arrive at a system with two non-identical machines. Class C₁ jobs with higher priority have dispatch preference over C₂ jobs with lower priority. The problem is to dispatch appropriate fractions of class C₁ jobs to machines 1 and 2 so that the average flow time of C₁ jobs is minimized and neither C₁ jobs nor C₂ 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;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control, 1989. Proceedings., IEEE International Symposium on

Conference_Location

Albany, NY

ISSN

2158-9860

Print_ISBN

0-8186-1987-2

Type

conf

DOI

10.1109/ISIC.1989.238705

Filename

238705