A simple load balancing problem with decentralized information
Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Cu...
Ausführliche Beschreibung
Autor*in: |
Pandelis, Dimitrios G. [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
1996 |
---|
Schlagwörter: |
---|
Anmerkung: |
© Physica-Verlag 1996 |
---|
Übergeordnetes Werk: |
Enthalten in: Mathematical methods of operations research - Physica-Verlag, 1996, 44(1996), 1 vom: Feb., Seite 97-113 |
---|---|
Übergeordnetes Werk: |
volume:44 ; year:1996 ; number:1 ; month:02 ; pages:97-113 |
Links: |
---|
DOI / URN: |
10.1007/BF01246331 |
---|
Katalog-ID: |
OLC2057875458 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2057875458 | ||
003 | DE-627 | ||
005 | 20230323143705.0 | ||
007 | tu | ||
008 | 200820s1996 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/BF01246331 |2 doi | |
035 | |a (DE-627)OLC2057875458 | ||
035 | |a (DE-He213)BF01246331-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 650 |a 330 |q VZ |
084 | |a 3,2 |2 ssgn | ||
084 | |a 85.00 |2 bkl | ||
100 | 1 | |a Pandelis, Dimitrios G. |e verfasserin |4 aut | |
245 | 1 | 0 | |a A simple load balancing problem with decentralized information |
264 | 1 | |c 1996 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a © Physica-Verlag 1996 | ||
520 | |a Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values. | ||
650 | 4 | |a Discrete Time | |
650 | 4 | |a Service Time | |
650 | 4 | |a Time Distribution | |
650 | 4 | |a Load Balance | |
650 | 4 | |a Service System | |
700 | 1 | |a Teneketzis, Demosthenis |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Mathematical methods of operations research |d Physica-Verlag, 1996 |g 44(1996), 1 vom: Feb., Seite 97-113 |w (DE-627)195962478 |w (DE-600)1310695-8 |w (DE-576)051452545 |x 1432-2994 |7 nnns |
773 | 1 | 8 | |g volume:44 |g year:1996 |g number:1 |g month:02 |g pages:97-113 |
856 | 4 | 1 | |u https://doi.org/10.1007/BF01246331 |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a SSG-OLC-WIW | ||
912 | |a GBV_ILN_11 | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_21 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_26 | ||
912 | |a GBV_ILN_30 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_34 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_78 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_132 | ||
912 | |a GBV_ILN_136 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_164 | ||
912 | |a GBV_ILN_267 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2006 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2012 | ||
912 | |a GBV_ILN_2018 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2057 | ||
912 | |a GBV_ILN_4012 | ||
912 | |a GBV_ILN_4028 | ||
912 | |a GBV_ILN_4029 | ||
912 | |a GBV_ILN_4036 | ||
912 | |a GBV_ILN_4046 | ||
912 | |a GBV_ILN_4082 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4193 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4310 | ||
912 | |a GBV_ILN_4311 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4314 | ||
912 | |a GBV_ILN_4317 | ||
912 | |a GBV_ILN_4318 | ||
912 | |a GBV_ILN_4319 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4700 | ||
936 | b | k | |a 85.00 |q VZ |
951 | |a AR | ||
952 | |d 44 |j 1996 |e 1 |c 02 |h 97-113 |
author_variant |
d g p dg dgp d t dt |
---|---|
matchkey_str |
article:14322994:1996----::smllablnigrbewtdcnr |
hierarchy_sort_str |
1996 |
bklnumber |
85.00 |
publishDate |
1996 |
allfields |
10.1007/BF01246331 doi (DE-627)OLC2057875458 (DE-He213)BF01246331-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Pandelis, Dimitrios G. verfasserin aut A simple load balancing problem with decentralized information 1996 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Physica-Verlag 1996 Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values. Discrete Time Service Time Time Distribution Load Balance Service System Teneketzis, Demosthenis aut Enthalten in Mathematical methods of operations research Physica-Verlag, 1996 44(1996), 1 vom: Feb., Seite 97-113 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:44 year:1996 number:1 month:02 pages:97-113 https://doi.org/10.1007/BF01246331 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_34 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_90 GBV_ILN_95 GBV_ILN_132 GBV_ILN_136 GBV_ILN_150 GBV_ILN_164 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2057 GBV_ILN_4012 GBV_ILN_4028 GBV_ILN_4029 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4314 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4700 85.00 VZ AR 44 1996 1 02 97-113 |
spelling |
10.1007/BF01246331 doi (DE-627)OLC2057875458 (DE-He213)BF01246331-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Pandelis, Dimitrios G. verfasserin aut A simple load balancing problem with decentralized information 1996 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Physica-Verlag 1996 Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values. Discrete Time Service Time Time Distribution Load Balance Service System Teneketzis, Demosthenis aut Enthalten in Mathematical methods of operations research Physica-Verlag, 1996 44(1996), 1 vom: Feb., Seite 97-113 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:44 year:1996 number:1 month:02 pages:97-113 https://doi.org/10.1007/BF01246331 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_34 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_90 GBV_ILN_95 GBV_ILN_132 GBV_ILN_136 GBV_ILN_150 GBV_ILN_164 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2057 GBV_ILN_4012 GBV_ILN_4028 GBV_ILN_4029 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4314 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4700 85.00 VZ AR 44 1996 1 02 97-113 |
allfields_unstemmed |
10.1007/BF01246331 doi (DE-627)OLC2057875458 (DE-He213)BF01246331-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Pandelis, Dimitrios G. verfasserin aut A simple load balancing problem with decentralized information 1996 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Physica-Verlag 1996 Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values. Discrete Time Service Time Time Distribution Load Balance Service System Teneketzis, Demosthenis aut Enthalten in Mathematical methods of operations research Physica-Verlag, 1996 44(1996), 1 vom: Feb., Seite 97-113 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:44 year:1996 number:1 month:02 pages:97-113 https://doi.org/10.1007/BF01246331 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_34 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_90 GBV_ILN_95 GBV_ILN_132 GBV_ILN_136 GBV_ILN_150 GBV_ILN_164 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2057 GBV_ILN_4012 GBV_ILN_4028 GBV_ILN_4029 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4314 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4700 85.00 VZ AR 44 1996 1 02 97-113 |
allfieldsGer |
10.1007/BF01246331 doi (DE-627)OLC2057875458 (DE-He213)BF01246331-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Pandelis, Dimitrios G. verfasserin aut A simple load balancing problem with decentralized information 1996 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Physica-Verlag 1996 Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values. Discrete Time Service Time Time Distribution Load Balance Service System Teneketzis, Demosthenis aut Enthalten in Mathematical methods of operations research Physica-Verlag, 1996 44(1996), 1 vom: Feb., Seite 97-113 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:44 year:1996 number:1 month:02 pages:97-113 https://doi.org/10.1007/BF01246331 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_34 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_90 GBV_ILN_95 GBV_ILN_132 GBV_ILN_136 GBV_ILN_150 GBV_ILN_164 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2057 GBV_ILN_4012 GBV_ILN_4028 GBV_ILN_4029 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4314 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4700 85.00 VZ AR 44 1996 1 02 97-113 |
allfieldsSound |
10.1007/BF01246331 doi (DE-627)OLC2057875458 (DE-He213)BF01246331-p DE-627 ger DE-627 rakwb eng 650 330 VZ 3,2 ssgn 85.00 bkl Pandelis, Dimitrios G. verfasserin aut A simple load balancing problem with decentralized information 1996 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Physica-Verlag 1996 Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values. Discrete Time Service Time Time Distribution Load Balance Service System Teneketzis, Demosthenis aut Enthalten in Mathematical methods of operations research Physica-Verlag, 1996 44(1996), 1 vom: Feb., Seite 97-113 (DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 1432-2994 nnns volume:44 year:1996 number:1 month:02 pages:97-113 https://doi.org/10.1007/BF01246331 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_34 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_90 GBV_ILN_95 GBV_ILN_132 GBV_ILN_136 GBV_ILN_150 GBV_ILN_164 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2057 GBV_ILN_4012 GBV_ILN_4028 GBV_ILN_4029 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4314 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4700 85.00 VZ AR 44 1996 1 02 97-113 |
language |
English |
source |
Enthalten in Mathematical methods of operations research 44(1996), 1 vom: Feb., Seite 97-113 volume:44 year:1996 number:1 month:02 pages:97-113 |
sourceStr |
Enthalten in Mathematical methods of operations research 44(1996), 1 vom: Feb., Seite 97-113 volume:44 year:1996 number:1 month:02 pages:97-113 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Discrete Time Service Time Time Distribution Load Balance Service System |
dewey-raw |
650 |
isfreeaccess_bool |
false |
container_title |
Mathematical methods of operations research |
authorswithroles_txt_mv |
Pandelis, Dimitrios G. @@aut@@ Teneketzis, Demosthenis @@aut@@ |
publishDateDaySort_date |
1996-02-01T00:00:00Z |
hierarchy_top_id |
195962478 |
dewey-sort |
3650 |
id |
OLC2057875458 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2057875458</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323143705.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s1996 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01246331</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2057875458</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01246331-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</subfield><subfield code="a">330</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pandelis, Dimitrios G.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A simple load balancing problem with decentralized information</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1996</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Physica-Verlag 1996</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Service Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Time Distribution</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Load Balance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Service System</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Teneketzis, Demosthenis</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Mathematical methods of operations research</subfield><subfield code="d">Physica-Verlag, 1996</subfield><subfield code="g">44(1996), 1 vom: Feb., Seite 97-113</subfield><subfield code="w">(DE-627)195962478</subfield><subfield code="w">(DE-600)1310695-8</subfield><subfield code="w">(DE-576)051452545</subfield><subfield code="x">1432-2994</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:1996</subfield><subfield code="g">number:1</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:97-113</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01246331</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_34</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_78</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_132</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_136</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_164</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4028</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4082</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4193</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">1996</subfield><subfield code="e">1</subfield><subfield code="c">02</subfield><subfield code="h">97-113</subfield></datafield></record></collection>
|
author |
Pandelis, Dimitrios G. |
spellingShingle |
Pandelis, Dimitrios G. ddc 650 ssgn 3,2 bkl 85.00 misc Discrete Time misc Service Time misc Time Distribution misc Load Balance misc Service System A simple load balancing problem with decentralized information |
authorStr |
Pandelis, Dimitrios G. |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)195962478 |
format |
Article |
dewey-ones |
650 - Management & auxiliary services 330 - Economics |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
1432-2994 |
topic_title |
650 330 VZ 3,2 ssgn 85.00 bkl A simple load balancing problem with decentralized information Discrete Time Service Time Time Distribution Load Balance Service System |
topic |
ddc 650 ssgn 3,2 bkl 85.00 misc Discrete Time misc Service Time misc Time Distribution misc Load Balance misc Service System |
topic_unstemmed |
ddc 650 ssgn 3,2 bkl 85.00 misc Discrete Time misc Service Time misc Time Distribution misc Load Balance misc Service System |
topic_browse |
ddc 650 ssgn 3,2 bkl 85.00 misc Discrete Time misc Service Time misc Time Distribution misc Load Balance misc Service System |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Mathematical methods of operations research |
hierarchy_parent_id |
195962478 |
dewey-tens |
650 - Management & public relations 330 - Economics |
hierarchy_top_title |
Mathematical methods of operations research |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)195962478 (DE-600)1310695-8 (DE-576)051452545 |
title |
A simple load balancing problem with decentralized information |
ctrlnum |
(DE-627)OLC2057875458 (DE-He213)BF01246331-p |
title_full |
A simple load balancing problem with decentralized information |
author_sort |
Pandelis, Dimitrios G. |
journal |
Mathematical methods of operations research |
journalStr |
Mathematical methods of operations research |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology 300 - Social sciences |
recordtype |
marc |
publishDateSort |
1996 |
contenttype_str_mv |
txt |
container_start_page |
97 |
author_browse |
Pandelis, Dimitrios G. Teneketzis, Demosthenis |
container_volume |
44 |
class |
650 330 VZ 3,2 ssgn 85.00 bkl |
format_se |
Aufsätze |
author-letter |
Pandelis, Dimitrios G. |
doi_str_mv |
10.1007/BF01246331 |
dewey-full |
650 330 |
title_sort |
a simple load balancing problem with decentralized information |
title_auth |
A simple load balancing problem with decentralized information |
abstract |
Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values. © Physica-Verlag 1996 |
abstractGer |
Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values. © Physica-Verlag 1996 |
abstract_unstemmed |
Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values. © Physica-Verlag 1996 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_34 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_78 GBV_ILN_90 GBV_ILN_95 GBV_ILN_132 GBV_ILN_136 GBV_ILN_150 GBV_ILN_164 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2057 GBV_ILN_4012 GBV_ILN_4028 GBV_ILN_4029 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4314 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4326 GBV_ILN_4700 |
container_issue |
1 |
title_short |
A simple load balancing problem with decentralized information |
url |
https://doi.org/10.1007/BF01246331 |
remote_bool |
false |
author2 |
Teneketzis, Demosthenis |
author2Str |
Teneketzis, Demosthenis |
ppnlink |
195962478 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/BF01246331 |
up_date |
2024-07-03T16:41:44.939Z |
_version_ |
1803576834722365440 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2057875458</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323143705.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s1996 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01246331</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2057875458</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01246331-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</subfield><subfield code="a">330</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pandelis, Dimitrios G.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A simple load balancing problem with decentralized information</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1996</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Physica-Verlag 1996</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Service Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Time Distribution</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Load Balance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Service System</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Teneketzis, Demosthenis</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Mathematical methods of operations research</subfield><subfield code="d">Physica-Verlag, 1996</subfield><subfield code="g">44(1996), 1 vom: Feb., Seite 97-113</subfield><subfield code="w">(DE-627)195962478</subfield><subfield code="w">(DE-600)1310695-8</subfield><subfield code="w">(DE-576)051452545</subfield><subfield code="x">1432-2994</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:1996</subfield><subfield code="g">number:1</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:97-113</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01246331</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_34</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_78</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_132</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_136</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_164</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4028</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4082</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4193</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">1996</subfield><subfield code="e">1</subfield><subfield code="c">02</subfield><subfield code="h">97-113</subfield></datafield></record></collection>
|
score |
7.399392 |