Designs of optimal switching feedback decentralized control policies for fluid queueing networks Authors V. Feoktistova Department of Mathematics and Mechanics Saint Petersburg University A. Matveev Department of Mathematics and Mechanics Saint Petersburg University E. Lefeber Department of Mechanical Engineering Eindhoven University of Technology J. E. Rooda Department of Mechanical Engineering Eindhoven University of Technology Open Access Original Article

First Online: 11 April 2012 Received: 12 September 2010 Accepted: 26 March 2012 DOI :
10.1007/s00498-012-0086-y

Cite this article as: Feoktistova, V., Matveev, A., Lefeber, E. et al. Math. Control Signals Syst. (2012) 24: 477. doi:10.1007/s00498-012-0086-y
Abstract The paper considers standard fluid models of multi-product multiple-server production systems where setup times are incurred whenever a server changes product. We consider a general approach to the problem of optimizing the long-run average cost per unit time that consists of first determining an optimal steady state (periodic) behavior and then to design a feedback scheduling protocol ensuring convergence to this behavior as time progresses. In this paper, we focus on the latter part and introduce a systematic approach. This approach gives rise to protocols that are cyclic and distributed: the servers do not need information about the entire system state. Each of them proceeds basically from the local data concerning only the currently served queue, although a fixed finite number of one-bit notification signals should be exchanged between the servers during every cycle. The approach is illustrated by simple instructive examples concerning polling systems, single server systems with processor sharing scheme, and the re-entrant two-server manufacturing network with non-negligible setup times introduced by Kumar and Seidman. For the last network considered in the analytical form, some cases of optimal steady-state (periodic) behavior are first recalled. For all examples, based on the desired steady state behavior and using the presented theory, we designed simple distributed feedback switching control laws. These laws not only give rise to the required behaviors but also make them globally attractive, irrespective of the system parameters and initial state.

Keywords Hybrid dynamical systems Optimal switched control Control of networks Fluid models Queueing This work was supported by the Netherlands Organization for Scientific Research (NWO-VIDI grant 639.072.072; NWO visitors grant 040.11.131), the Russian Foundation for Basic Research (grant 09-08-00803), the Russian Federal Program (grant N 1.1-111-128-033) and the Russian Federal Program “Research and Teaching Cadres” (contract N 16.740.11.0042).

Download to read the full article text

References 1.

Bai S, Elhafsi M (1994) Optimal feedback control of a manufacturing system with setup changes. In: Proceedings of of the 4th international conference on computer integrated manufacturing and automation technology, pp 191–196

2.

Baker KR (1974) Introduction to sequencing and scheduling

3.

Banks J, Dai JG (1997) Simulation studies of multiclass queueing networks. IIE Trans 29: 213–219

4.

Boxma O, Levy H, Weststrate J (1991) Efficient visit frequencies for polling tables: minimization of waiting cost. Queueing Syst 9: 133–162

MATH CrossRef 5.

Bramson M (2008) Stability of queueing networks. Springer, Berlin

MATH 6.

Chase C, Serrano J, Ramadge PJ (1993) Periodicity and chaos from switched flow systems: contrasting examples of discretely controlled continuous systems. IEEE Trans Autom Control 38(1): 70–83

MathSciNet MATH CrossRef 7.

Connolly S, Dallery Y, Gershwin S (1992) A real-time policy for performing setup changes in a manufacturing system. In: Proceedings of the 31st IEEE conference on decision and control, pp 764–770. Tucson, AZ

8.

Dai JG, Vande Vate JH (2000) The stability of two-station multitype fluid networks. Oper Res 48: 721–744

MathSciNet MATH CrossRef 9.

van Eekelen JAWM (2007) Modelling and control of discrete event manufactoring flow lines. Ph.D. thesis, Technical University of Eindhoven, Eindhoven, The Netherlands

10.

Feoktistova V, Matveev A (2009) Generation of production cycles in multiple server systems with setup times: the case study. In: Proceedings of the 13th IFAC Symposium on information control problems in manufacturing, pp 568–573. Moscow, Russia

11.

Flieller D, Riedinger P, Louis JP (2006) Computation and stability of limit cycles in hybrid systems. Nonlinear Anal 64: 352–367

MathSciNet MATH CrossRef 12.

Gamarnik D, Hasenbein JJ (2005) Instability in stochastic and fluid queueing networks. Queueing Syst 15: 1652–1690

MathSciNet MATH 13.

Gaudio MD, Martinelli E, Valigi P (2001) A scheduling problem for two competing queues with finite capacity and non negligible setup times. In: Proceedings of the 40th IEEE conference on decision and control, pp 2355–2360. Orlando, FL

14.

Gaujal B, Hordijk A, van der Laan D (2007) On the optimal open-loop policy for deterministic and exponential polling systems. Probab Eng Inf Sci 27(2): 157–187

MathSciNet 15.

Gaujal B, Hyon E (2000) Optimal routing policy in two deterministic queues. Calc Paralleles 13: 601–634

16.

Gaujal EAB, Hordijk A (2000) Optimal open-loop control of vacations, polling and service assignment. Queueing Syst 36: 303–325

MathSciNet MATH CrossRef 17.

Gross D, Harris G (1985) Fundamentals of queueing theory. Wiley Series in Probability and Mathematical Statistics

18.

Horn C, Ramadge PJ (1997) A topological analysis of a family of dynamical systems with nonstandard chaotic and periodic behavior. Int J Control 67(6): 979–1020

MathSciNet MATH CrossRef 19.

Hu J, Caramanis M (1992) Near optimal set-up scheduling for flexible manufacturing systems. In: Proceedings of the 3rd international conference on computer integrated manufacturing and automation technology, pp 192–201

20.

Humes C (1994) A regulator stabilization technique: Kumar–Seidman revisited. IEEE Trans Autom Control 39(1): 191–196

MathSciNet MATH CrossRef 21.

Perkins JR, Humes C Jr, Kumar PR (1994) Distributed scheduling of flexible manufacturing systems: stability and performance. IEEE Trans Robotics Autom 10(2): 133–141

CrossRef 22.

Kelly FP, Williams R (2004) Fluid model for a network operating under a fair bandwidth sharing policy. Ann Appl Probab 14: 1055–1083

MathSciNet MATH CrossRef 23.

Kumar PR, Seidman TI (1990) Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems. IEEE Trans Autom Control 35(3): 289–298

MathSciNet MATH CrossRef 24.

Lan WM, Olsen T (2006) Multiproduct systems with both setup times and costs: fluid bounds and schedules. Oper Res 54(3): 505–525

MathSciNet MATH CrossRef 25.

Lefeber E (2011) Optimal performance of multiclass queueing networks with setup times: the Kumar–Seidman network as an example. SE Report, Eindhoven University of Technology, Systems Engineering Group, Department of Mechanical Engineering, Eindhoven, The Netherlands.

http://se.wtb.tue.nl/sereports . Mathematical Methods of Operations Research (submitted)

26.

Lefeber E, Rooda J (2008) Controller design for flow networks of switched servers with setup times: the Kumar–Seidman case as an illustrative example. Asian J Control 10(1): 55–66

MathSciNet CrossRef 27.

Lefeber E, Rooda JE (2006) Controller design of switched linear systems with setups. Physica A 363(1)

28.

Lefeber E, Lämmer S (2008) Rooda, J Tech. Rep. SE 2008-09, Department of Mechanical Engineering, Eindhoven University of Technology.

http://se.wth.tue.nl/sereports
29.

Lu SH, Kumar PR (1991) Distributed scheduling based on due dates and buffer priorities. IEEE Trans Autom Control 36(12): 1406–1416

CrossRef 30.

Munkres JR (1991) Analysis on manifolds. Addison-Wesley Publishing Company, Reading

MATH 31.

Ouelhadj D, Petrovic S (2008) A survey of dynamic scheduling in manufacturing systems. J Sched 1099–1425

32.

Perkins J, Kumar PR (1989) Stable, distributed, real-time scheduling of flexible manufactoring/assembly/disassembly systems. IEEE Trans Autom Control 34(2): 139–148

MathSciNet MATH CrossRef 33.

Pinedo M (2008) Scheduling theory: algorithms and systems, 3rd edn. Prentice Hall, New York

34.

Savkin A (1998) Regularizability of complex switched server queueing networks modelled as hybrid dynamical systems. Syst Control Lett 35: 291–299

MathSciNet MATH CrossRef 35.

Savkin AV (2000) Cyclic linear differential automata: a simple class of hybrid dynamical systems. Automatica 36(5): 727–734

MathSciNet MATH CrossRef 36.

Savkin AV (2001) A switched single server system of order

n with all its trajectories converging to (

n −1)! limit cycles. Automatica 37(2): 303–306

MathSciNet MATH CrossRef 37.

Takagi H (2000) Analysis and application of polling models. In: Haring G, Lindemann C, Reiser M (eds) Performance evaluation: origins and directions. Lecture Notes in Computer Science, vol 1769. Springer, Berlin, pp 423—442

38.

Ushio T, Ueda H, Hirai K (1996) Stabilization of periodic orbits in switched arrival systems with n buffers. In: Proceedings of the 35th IEEE conference on decision and control, pp 1213–1214. Kobe, Japan

39.

Wierman A, Winands E, Boxma O (2007) Scheduling in polling systems. Perform Eval 64: 1009–1028

CrossRef 40.

Zhang Z, Towsley D, Kurose J (1995) Statistical analysis of the generalized processor sharing scheduling discipline. IEEE J Selected Areas Commun 13: 1071–1080

CrossRef