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

Meng Chu Zhou; Pitu B. Mirchandani

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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

Original language	English (US)
Title of host publication	Proc IEEE Int Symp Intell Control 1989
Editors	Arthur C. Sanderson, Alan A. Desrochers, Kimon Valavanis
Publisher	Publ by IEEE
Pages	138-143
Number of pages	6
ISBN (Print)	0818689870
State	Published - 1989
Externally published	Yes
Event	Proceedings: IEEE International Symposium on Intelligent Control 1989 - Albany, NY, USA Duration: Sep 25 1989 → Sep 26 1989

Publication series

Name	Proc IEEE Int Symp Intell Control 1989

Other

Other	Proceedings: IEEE International Symposium on Intelligent Control 1989
City	Albany, NY, USA
Period	9/25/89 → 9/26/89

ASJC Scopus subject areas

General Engineering

Cite this

Optimal dispatching of two-priority job streams to two nonidentical machines. / Zhou, Meng Chu; Mirchandani, Pitu B.
Proc IEEE Int Symp Intell Control 1989. ed. / Arthur C. Sanderson; Alan A. Desrochers; Kimon Valavanis. Publ by IEEE, 1989. p. 138-143 (Proc IEEE Int Symp Intell Control 1989).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

@inproceedings{0cba5d327e7946c384a499292134aa07,

title = "Optimal dispatching of two-priority job streams to two nonidentical machines",

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.",

author = "Zhou, {Meng Chu} and Mirchandani, {Pitu B.}",

year = "1989",

language = "English (US)",

isbn = "0818689870",

series = "Proc IEEE Int Symp Intell Control 1989",

publisher = "Publ by IEEE",

pages = "138--143",

editor = "Sanderson, {Arthur C.} and Desrochers, {Alan A.} and Kimon Valavanis",

booktitle = "Proc IEEE Int Symp Intell Control 1989",

note = "Proceedings: IEEE International Symposium on Intelligent Control 1989 ; Conference date: 25-09-1989 Through 26-09-1989",

}

TY - GEN

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

AU - Zhou, Meng Chu

AU - Mirchandani, Pitu B.

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024923676&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024923676&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024923676

SN - 0818689870

T3 - Proc IEEE Int Symp Intell Control 1989

SP - 138

EP - 143

BT - Proc IEEE Int Symp Intell Control 1989

A2 - Sanderson, Arthur C.

A2 - Desrochers, Alan A.

A2 - Valavanis, Kimon

PB - Publ by IEEE

T2 - Proceedings: IEEE International Symposium on Intelligent Control 1989

Y2 - 25 September 1989 through 26 September 1989

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this