@conference {
	title = {A Continuous-Time Distributed Version of Wald{\textquoteright}s Sequential Hypothesis Testing Problem},
	author = {Makowski, Armand M., LaVigna, Anthony., Baras, John S.},
	year = {1986},
	month = {10/1986},
	address = {Ann Arbor, MI},
	booktitle = {The 1986 IEEE International Symposium on Information Theory},
	pages = {pp. 533-543}
}
@conference {
	title = {A Continuous-Time Distributed Version of Wald{\textquoteright}s Sequential Hypothesis Testing Problem},
	author = {LaVigna, Anthony., Makowski, Armand M., Baras, John S.},
	year = {1986},
	month = {06/1986},
	address = {Antibes, France},
	booktitle = {The Seventh International Conference on Analysis and Optimization of Systems},
	pages = {pp. 533-543},
	organization = {INRIA}
}
@conference {
	title = {Stability, Parameter Estimation and Adaptive Control for Discrete-Time Competing Queues},
	author = {Baras, John S., Dorsey, Arthur J., Makowski, Armand M.},
	year = {1984},
	month = {12/1984},
	abstract = {In this paper, several discrete-time queues compete~at the beginning of each time slot for the attention of a single server with infinite capacity. The service requirements are geometric with queue-dependent parameters, independent from customer to customer and independent from the arrivals. The stability of such systems is characterized under the action of an arbitrary , not necessarily Markovian, service allocation policy. Maximum likelihood estimates are obtained in explicit form for the service rates and their strong consistency is established.The results are then applied to the problem of adaptively controlling such systems when the service rates are unknown, under the long-run average performance criterion with instantaneous cost linear in the queue sizes.},
	address = {Las Vegas, Nevada},
	booktitle = {The 23rd IEEE Conference on Decision and Control},
	pages = {pp. 1149-1157}
}
@conference {
	title = {Discrete-Time Competing Queues with Geometric Service Requirements:  Stability, Parameter Estimation and Adaptive Control},
	author = {Baras, John S., Dorsey, Arthur J., Makowski, Armand M.},
	year = {1984},
	month = {05/1984},
	abstract = {In this paper, several discrete-time queues compete at the beginning of each time slot for the attention of a single server with infinite capacity. The service requirements are geometric with queue dependent parameters, independent from customer to customer and independent from the arrivals. The stability of such systems is characterized under the action~of an arbitrary, not necessarily Markovian, service allocation policy. Maximum likelihood estimates are obtained in explicit form for the service rates and their~strong consistency is established. The results are then applied to the problem of adaptively controlling such systems when the service rates are unknown, under the long-run average performance criterion with instantaneous cost linear in the queue sizes.},
	address = {San Francisco, California},
	booktitle = {1984 Joint TIMS/ORSA Meeting}
}
@conference {
	title = {Two Competing Queues with Linear Costs and Geometric Service Requirements},
	author = {Baras, John S., Dorsey, Arthur J., Makowski, Armand M.},
	year = {1983},
	month = {12/1983},
	abstract = {A discrete-time model is presented for a system of two queues cmompeting for the service attention of a single server with infinite buffer capacity. The service requirements are geometrically distributed and independent from customer to customer as well as from the arrivals. The allocation of service attention is governed by feedback policies which are based on past decisions and buffer content histories. The cost of operation per unit time is a linear function of queue sizes. Under the model assumptions, a fixed prioritization scheme known as the~{\textmu}c-rule, is shown to be optimal for the long run average criterion and for the expected discounted-criterion, over both finite and infinite horizons. Two different approaches are proposed to solve these problems. One is based on dynamic programming methodology for markov decision processes, and assumes the arrival to be i.i.d. The other is valid under no additional assumptions on the arrival streams and uses direct comparision arguments. In both cases the sample path properties of the adopted state-space model are exploited.},
	address = {San Antonio, Texas},
	booktitle = {22nd IEEE Conference on Decision and Control},
	pages = {pp. 1173-1178}
}
@conference {
	title = {Two Competing Queues with Linear Costs: The  μc-rule is Often Optimal},
	author = {Baras, John S., Dorsey, Arthur J., Makowski, Armand M.},
	year = {1983},
	month = {12/1983},
	abstract = {A discrete-time model is presented for a system of two queues competing for the service attention of a single server with infinite buffer capacity. The service requirements are geometrically distributed and independent from customer to customer as well as from the arrivals. The allocation of service attention is governed by feedback policies which are based on past decisions and buffer content histories. The cost of operation per unit time is a linear function of the queue sizes. Under the model assumptions, a fixed prioritization scheme, known as the uc-rule, is shown to be optimal for the expected long-run average criterion and for the expected discounted criterion, over both finite and infinite horizons. Two different approaches are proposed for solving these problems. One is based on the dynamic programming methodology for Markov decision processes, and assumes the arrivals to be i.i.d. The other is valid under no additional assumption on the arrival stream and uses direct comparison arguments. In both cases, the sample path properties of the adopted state-space model are exploited.},
	address = {San Antonio, Texas},
	booktitle = {22nd IEEE Conference on Decision and Control},
	pages = {pp. 186-209}
}
@article {
	title = {K Competing Queues With Geometric Service Requirements and Linear Costs: The uc-rule is Always Optimal},
	author = {Baras, John S., Ma, D -J., Makowski, Armand M.},
	year = {1985},
	month = {08/1985},
	abstract = {In this note, a discrete-time system of K competing queues with geometric service requirements and arbitrary arrival patterns is studied. When the cost per slot is linear in the queue sizes, it is shown that the {\textmu}c-rule minimizes the expected discounted cost over the infinite horizon.},
	pages = {pp. 173-180},
	volume = {Vol. 6},
	number = {No. 3},
	journal = {Systems and Control Letters}
}
@article {
	title = {Two Competing Queues with Linear Costs and Geometric Service Requirements},
	author = {Baras, John S., Dorsey, Arthur J., Makowski, Armand M.},
	year = {1985},
	month = {01/1985},
	abstract = {A discrete-time model is presented for a system of two queues competing for the service attention of a single server with infinite buffer capacity. The service requirements are geometrically distributed and independent from customer to customer as well as from the arrivals. The allocation of service attention is governed by feedback policies which are based on past decisions and buffer content histories. The cost of operation per unit time is a linear function of queue sizes. Under the model assumptions, a fixed prioritization scheme known as the~{\textmu}c-rule, is shown to be optimal for the long run average criterion and for the expected discounted-criterion, over both finite and infinite horizons. Two different approaches are proposed to solve these problems. One is based on dynamic programming methodology for Markov decision processes and assumes the arrival to be i.i.d. The other is valid under no additional assumptions on the arrival streams and uses direct comparison arguments. In both cases, the sample path properties of the adopted state-space model are exploited.},
	pages = {pp. 186-209},
	volume = {Vol. 17},
	journal = {Advances in Applied Probability}
}
