Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Optimal configurations of general job shops
Autore:
Giloni, A; Seshadri, S;
Indirizzi:
Yeshiva Univ, Sy Syms Sch Business, New York, NY 10033 USA Yeshiva Univ New York NY USA 10033 s Sch Business, New York, NY 10033 USA NYU, Stern Sch Business, Operat Management Dept, New York, NY 10012 USA NYU New York NY USA 10012 Operat Management Dept, New York, NY 10012 USA
Titolo Testata:
QUEUEING SYSTEMS
fascicolo: 2-3, volume: 39, anno: 2001,
pagine: 137 - 155
SICI:
0257-0130(2001)39:2-3<137:OCOGJS>2.0.ZU;2-5
Fonte:
ISI
Lingua:
ENG
Keywords:
open queueing networks; job shop; renewal process; concave/convex optimization;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
7
Recensione:
Indirizzi per estratti:
Indirizzo: Giloni, A Yeshiva Univ, Sy Syms Sch Business, 500 W 185th St, New York, NY10033 USA Yeshiva Univ 500 W 185th St New York NY USA 10033 , NY 10033 USA
Citazione:
A. Giloni e S. Seshadri, "Optimal configurations of general job shops", QUEUEING S, 39(2-3), 2001, pp. 137-155

Abstract

In this paper we study the problem of minimizing the expected number of jobs in a single class general open queueing network model of a job shop. This problem was originally posed by Buzacott and Shanthikumar [2] and solved by them for a special case. We extend their work in this paper. We derive feasibility conditions that simplify the analysis of the problem. We show that the optimal configuration can be completely characterized when both the utilizations of the machine centers are high and there are a large number of servers at each machine center. We also derive conditions under which theoptimization problem reduces to solving a concave or a convex program and provide conditions under which the uniform flow line and the symmetric job shop (or variants of these) are optimal configurations for the job shop.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 05/04/20 alle ore 19:29:37