Entry Koole:1997:ASS from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Koole:1997:ASS,
author = "Ger Koole",
title = "Assigning a single server to inhomogeneous queues with
switching costs",
journal = j-THEOR-COMP-SCI,
volume = "182",
number = "1--2",
pages = "203--216",
day = "15",
month = aug,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:05 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=182&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=182&issue=1-2&aid=2398",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C4240C (Computational
complexity); C4240P (Parallel programming and algorithm
theory); C5470 (Performance evaluation and testing)",
corpsource = "Dept. of Math. and Comput. Sci., Vrije Univ.,
Amsterdam, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; holding costs;
inhomogeneous queues; limiting behavior; parallel
algorithms; performance evaluation; Poisson processes;
preemptive assignment; queueing theory; service times;
single server; switching costs; threshold policy",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- assignment,
151(2)385,
156(1)177,
170(1)83,
170(1)173,
180(1)287,
194(1)123,
194(1)240-1,
207(1)193
- behavior,
134(1)51,
140(2)319,
143(2)251,
144(1)161,
145(1)1,
151(1)37,
165(1)97,
174(1)157,
175(2)225,
176(1)1,
187(1)7,
189(1)1,
189(1)229,
193(1)197,
217(1)31
- C1140C,
144(1)277,
155(1)141,
177(2)487,
182(1)145
- C5470,
164(1)107,
182(1)159,
185(2)259,
196(1)319,
196(1)347,
197(1)171
- cost,
144(1)199,
156(1)301,
156(1)315,
164(1)185,
165(2)441,
168(1)21,
173(1)113,
181(1)75,
182(1)233,
191(1)229,
194(1)207,
196(1)241,
219(1)301
- evaluation,
140(1)73,
142(1)125,
143(1)167,
146(1)145,
162(1)133,
163(1)269,
164(1)107,
171(1)25,
171(1)179,
178(1)237,
181(1)45,
182(1)159,
185(2)259,
187(1)105,
187(1)203,
187(1)231,
195(2)155,
196(1)31,
196(1)241,
196(1)319,
196(1)347,
197(1)171,
210(1)199
- limiting,
144(1)67,
159(1)65,
176(1)89
- performance,
138(1)141,
140(1)73,
163(1)239,
164(1)107,
178(1)119,
181(1)45,
182(1)159,
182(1)233,
185(2)259,
196(1)31,
196(1)241,
196(1)289,
196(1)319,
196(1)347,
197(1)171,
215(1)263
- Poisson,
190(2)151
- policy,
138(1)201
- queue,
148(1)171,
164(1)1,
177(2)487,
182(1)145,
205(1)99
- queueing,
144(1)277,
155(1)141,
177(2)487,
182(1)145
- service,
154(1)57,
155(1)141,
187(1)221,
192(2)201,
220(1)113
- single,
145(1)357,
148(1)141,
154(2)225,
160(1)1,
160(1)305,
193(1)75,
194(1)245
- switching,
137(1)109,
138(1)101,
156(1)99,
156(1)263,
174(1)137,
174(1)217,
174(1)269,
178(1)103,
178(1)237,
182(1)171,
185(2)347,
188(1)117,
189(1)221,
194(1)123
- testing,
139(1)275,
142(2)257,
146(1)341,
150(1)161,
162(1)133,
164(1)107,
167(1)131,
167(1)193,
173(1)113,
173(1)209,
173(1)235,
174(1)231,
175(2)373,
176(1)1,
177(1)183,
177(2)407,
180(1)17,
180(1)217,
180(1)309,
182(1)159,
183(2)215,
183(2)229,
183(2)253,
185(2)259,
186(1)135,
188(1)79,
192(1)55,
195(2)259,
196(1)241,
196(1)319,
196(1)347,
197(1)171,
197(1)171-1,
201(1)85
- threshold,
137(1)109,
154(2)307,
156(1)99,
158(1)193,
168(2)405,
174(1)123,
174(1)137,
180(1)47,
209(1)123,
226(1)185