Optimal dispatching of two-priority job streams to two nonidentical machines

Meng Chu Zhou, Pitu B. Mirchandani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The following control problem in manufacturing is addressed. Jobs of two priority classes, C1 and C2, arrive at a system with two nonidentical 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 1) nonpreemptive priorities, 2) preemptive priorities with resumption, 3) preemptive priorities with resumption and setup, and 4) nonpreemptive priorities with multiple vacations.

Original languageEnglish (US)
Title of host publicationProc IEEE Int Symp Intell Control 1989
EditorsArthur C. Sanderson, Alan A. Desrochers, Kimon Valavanis
PublisherPubl by IEEE
Pages138-143
Number of pages6
ISBN (Print)0818689870
StatePublished - Dec 1 1989
EventProceedings: IEEE International Symposium on Intelligent Control 1989 - Albany, NY, USA
Duration: Sep 25 1989Sep 26 1989

Publication series

NameProc IEEE Int Symp Intell Control 1989

Other

OtherProceedings: IEEE International Symposium on Intelligent Control 1989
CityAlbany, NY, USA
Period9/25/899/26/89

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Zhou, M. C., & Mirchandani, P. B. (1989). Optimal dispatching of two-priority job streams to two nonidentical machines. In A. C. Sanderson, A. A. Desrochers, & K. Valavanis (Eds.), Proc IEEE Int Symp Intell Control 1989 (pp. 138-143). (Proc IEEE Int Symp Intell Control 1989). Publ by IEEE.