Dynamic Scheduling for a Flexible Processing Network

Ick-Hyun Nam ()
Additional contact information
Ick-Hyun Nam: College of Business Administration, Seoul National University, Korea 151-742

Operations Research, 2001, vol. 49, issue 2, 305-315

Abstract: We study flexible processing systems where there are multiple paths for a certain type of customer to follow through the system. This paper analyzes an open processing network model with discretionary routing. The underlying methodology is the heavy traffic approximation, which has been well publicized by many researchers. Allowing priority sequencing in addition to dynamic routing as our control policy, we show that the balanced workload routing rule does not necessarily give us an optimal solution. In general unbalanced workload routing with priority sequencing is shown to give us better performance than a balanced one. Through some simulation results we compare our recommendation with other scheduling policies for a flexible processing network.

Keywords: Queues:; dynamic; scheduling; for; a; queueing; network; using; Brownian; approximation (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.49.2.305.13527 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:49:y:2001:i:2:p:305-315

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().