
IEEE/CAA Journal of Automatica Sinica
Citation: | Bing Wang, Xuedong Xia, Hexia Meng and Tao Li, "Bad-scenario-set Robust Optimization Framework With Two Objectives for Uncertain Scheduling Systems," IEEE/CAA J. Autom. Sinica, vol. 4, no. 1, pp. 143-153, Jan. 2017. |
Dear Editor,
This letter investigates global stabilization of uncertain nonlinear systems via adaptive event-triggered output feedback. Uncertainties lie in both system nonlinearities and measurement sensitivity. To this end, a dynamic high gain is introduced to cope with the influence of large uncertainties, the unknown measurement sensitivity and the execution error, while a time-varying threshold event-triggering mechanism is constructed to effectively exclude the Zeno phenomenon. As such, the adaptive event-triggered control ensures globally bounded and convergent of system states. The design method is demonstrated using a controlled pendulum example.
Event-triggered control has become popular over the past $20 $ years for improving feedback ability and saving resources in large-scale networks and distributed control. Researchers continue to develop better triggering mechanisms and expanding broader adaptation scenarios, e.g., dynamic event-triggering mechanism [1], adaptive event-triggering mechanism [2], [3], intelligent transportation [4].
Nonlinear systems are commonly affected by uncertainties, including parameter uncertainties and external disturbances [5], which could be suppressed by feedback control. While due to limitations in measurement technology and tooling accuracy, sensor sensitivity is sometimes unknown in real-world scenarios, which poses a new challenge for nonlinear system control. Recent studies propose some methods to address this issue, including a dual-domination approach [6], non-identifier based upon output-feedback control [7], combining tangent-type barrier Lyapunov function and Nussbaum-type function [8], time-varying gain for feedforward nonlinear systems [9], fuzzy logic systems for stochastic nonlinear multiagent systems [10]. Nonetheless, these methods may have some limitations, such as requiring additional information on system nonlinearities [8], the inability to guarantee the boundedness of the gain [9], or being limited to a local objective rather than a global one [10]. Therefore, how to design appropriate adaptive compensation when large uncertainties, unknown sensitivity and execution error coexist, and how to exclude the Zeno phenomenon under the influence of the unmeasurable states, have become difficult and interesting problems, on which, to our knowledge, there are few reports.
Motivated by the aforementioned, this letter studies the global stabilization of nonlinear systems through adaptive event-triggered output feedback in the presence of large uncertainties and unknown measurement sensitivity coupling to unmeasurable states. The innovative contributions of this letter focus on the following two aspects.
1) The coexistence of large uncertainties and unknown measurement sensitivity renders the event-triggered feedback design challenging. To address this, it is commended a dynamic high gain that can be adequately large to be effective while remains bounded. However, in [11], merely weak uncertainties are allowed due to lacking compensating mechanisms, while in [9], the gain signal is time-varying and would tend towards infinity as time goes on.
2) A time-varying threshold event-triggering mechanism is constructed to avoid the Zeno phenomenon effectively. The threshold is strictly positive but decays to zero, ensuring control feasibility and global convergence of system states to zero. Reference [12] merely ensures boundedness of system states because the threshold owns a positive constant lower bound, while [10] achieves a semi-global objective.
Problem statement: Consider nonlinear system as
{˙xi=xi+1+gi(t,x),i=1,…,n−1˙xn=u+gn(t,x)y=θ1x1 | (1) |
where $ x = [x_1,\ldots,x_n]^{T}\in\mathbb{R}^n $ is the system state equipped with $ x(0) = x_0 $; $ u\in\mathbb{R} $ is the control input; $ y\in\mathbb{R} $ is the system output; unknown constant $ \theta_1\in\mathbb{R}_+ $ represents the measurement sensitivity; unknown functions $ g_i: [0,+\infty)\times\mathbb{R}^n $, $ i = 1,\ldots, n $, are locally Lipschitz and continuous in x and t, respectively.
Assumption 1: There is an unknown constant $ \theta_2\in\mathbb{R}_+ $ that satisfies $ |g_i(x,u,t)| \leq \theta_2\Big(|y|+\sum_{j = 2}^i|x_j|\Big) $, $ i = 1,\ldots,n $.
Assumption 2: There exist two known positive constants $ \bar{\theta} $ and $ \underline{\theta} $, such that $ 0<\underline{\theta}\leq\theta_1\leq\bar\theta $.
Remark 1: Assumption 1 implies that system (1) allows large uncertainties while the nonlinearities depend strongly on the unmeasurable states. Assumption 2 means that the measurement sensitivity is unknown. The two pose new challenges and promote the birth of the following improved event-triggered output-feedback control schemes.
Event-triggered control design: First, to rebuild the unmeasurable states in system (1), construct a high-gain state observer as
{˙ˆxi=ˆxi+1−Liaiˆx1,i=1,…,n−1˙ˆxn=u−Lnanˆx1 | (2) |
where design parameters $ a_i\in\mathbb{R}_+ $, and gain L satisfies updating law
˙L=(yL)2+n∑i=2(ˆxiLi)2,L(0)=1. | (3) |
It follows from (3) that dynamic gain $ L(t)\geq1 $ is nondecreasing, which shows that L could be as large as enough to deal with system uncertainties and unknown measurement sensitivity. Notably, gain L is online adjusted, which means that once the initial value is given, L would evolve automatically according to the system behavior.
Then the adaptive event-triggered controller based on the emulation approach is designed as
{u(t)=ω(tk),t∈[tk,tk+1)ω(L,ˆx,y)=−βnLn+1ηn | (4) |
where $ \omega\big(L(t), \hat x(t), y(t)\big) $ is abbreviated as $ \omega(t) $ following the design process in [7]. The times $ t_k $’s, i.e., the ones on which execution occurs, are yielded recursively from event-triggering mechanism as
tk+1=inf{t>tk||δ(tk)|>e−αt} | (5) |
with $ \delta(t_k) = \omega(t)-\omega(t_k) $, initial time $ t_1 = 0 $ and pre-specified positive constant α. Define scaling transformation
zi=ˆxiLi,εi=xi−ˆxiLi,i=1,…,n. | (6) |
Denote $ z = [z_1,\ldots,z_n]^{T} $ and $ \varepsilon = [\varepsilon_1,\ldots,\varepsilon_n]^{T} $. Then, (1)–(3) imply
{D+z=−LβnηnC+LAz−˙LLDz+u−ωLnCD+ε=−˙LL+LAε+1θ1ay+˜g | (7) |
where $ A = [-a\,\, [I_{n-1}\,\, 0_{n-1}]^{T}] $ with $ a = [a_1,\ldots,a_n]^{T} $, $ C = [0,\ldots,0,1]^{T} $, $ D = {{\rm{diag}}}\{1,\ldots,n\} $, and $ \tilde{g} = \big[\frac{g_1}{L},\ldots,\frac{g_n}{L^n}\big]^{T} $. Design parameters $ a_i $’s can suitably be selected such that A is Hurwitz; there is a positive definite symmetric P such that
ATP+PA≤−I,DP+PD≥0. | (8) |
From Lemma 1 in [13], it follows that the selection of parameters $ a_i$’s can always be achievable.
Consider the following scaling transformation and candidate Lyapunov functions similar to those in [7]:
η1=yL,ηi=ˆxi−ˆx∗iLi,V1=12r1η21,Vi=Vi−1+η2i2ri | (9) |
where $ \hat{x}_i^* = -\beta_{i-1}L^i\eta_{i-1} $, $ \beta_1 = \frac{1}{\underline{\theta}}\big(\frac{2\|Pa\|^2}{\underline{\theta}^2}(n+1)+b_1+n\big) $, $ \beta_i = r_i(b_i+n) $, $ r_i = \frac{n(i-1)(n-i+2)\prod_{k = 1}^{i-1}\beta_k^2}{4i}r_{i-1} $, $ b_1 = \frac{3}{4}\bar\theta^2 $, $ b_i>0 $ are suitable constants, and $ i = 2,\ldots,n $. Then, the following proposition describes the dynamic evolution. The detailed proof is omitted here since it can be obtained by a simple calculation.
Proposition 1: Choose candidate Lyapunov functions $ V_z = z^{T} P z $ and $ V_\varepsilon = \varepsilon^{T} P\varepsilon $. Then, it follows:
{D+Vz≤−L2‖ |
in which the upper right-hand derivative of V is represented by $ D^+V $ while $ \Theta_1>0 $ is unknown.
Main results: As the similar discussion in [2], it can be deduced that, the solution $ (x,\hat x,L) $ exists, and is unique on the maximum interval $ [0,T_m) $ for any initial condition $ (x_0,\hat x_0) $.
Proposition 2: The boundedness of gain $ L(t) $ suggests that both $ z(t) $ and $ \varepsilon(t) $ are bounded on interval $ [0,T_m) $, as well as
\begin{eqnarray*} \lim_{t\to T_m}\int_0^{t}\Big(\|\varepsilon(s)\|^2+\|z(s)\|^2\Big) {{d}} s < +\infty. \end{eqnarray*} |
Proof: It follows from the boundedness of the gain that $ \bar L = $ $ \sup_{t\in[0,T_m)}L(t) = \lim_{t\to T_m}L(t) $, for some positive constant $ \bar{L} $.
1) $ z(t) $ is bounded and quadratic integrable for any $ t\in[0,T_m) $.
From Proposition 1, one has
\begin{equation*} D^+V_z \leq-\frac{L}{2}\|z\|^2+4\beta_n^2\|PC\|^2L\eta_n^2+\frac{4\|PC\|^2}{L^{2n+1}e^{2\alpha t}}. \end{equation*} |
From the definition of $ \hat x_i^* $ and $ \eta_i $, it can be recursively derived $ \hat x_n^* = -\sum_{i = 1}^{n-2}\left(\prod_{j = 1}^i\beta_{n-j}\right)L^i\hat x_{n-i}-\left(\prod_{i = 1}^{n-1}\beta_i\right)L^{n-1}y $, which combining with (9) implies $ \eta_n^2 \leq M\big(\frac{y}{L}\big)^2+M\sum_{i = 2}^n\big(\frac{\hat x_i}{L^i}\big)^2 = M\dot L $, where $ M = $ $\max\big\{n,n\big(\prod_{j = 1}^i\beta_{n-j}\big)^2,n\big(\prod_{k = 1}^{n-1}\beta_k\big)^2\big\} $, $ i = 1,\ldots,n-2 $. Then, by the hypothesis and noting $ L\geq1 $ and $ V_z = z^{T} P z $, there holds
\begin{equation} D^+V_z \leq-\lambda V_z+4\|PC\|^2\beta_n^2\bar L\dot L+\frac{4\|PC\|^2}{e^{2\alpha t}} \end{equation} | (10) |
with $ \lambda = \frac{1}{2\lambda_{\max(P)}} $, which is equivalent to
\begin{equation*} D^+\big(e^{\lambda t}V_z\big) \leq 4\beta_n^2\|PC\|^2\bar Le^{\lambda t}\dot L+4\|PC\|^2e^{\lambda t}. \end{equation*} |
Then, for $ \forall t\in[0,T_m) $ we get $ V_z(t) \leq 4 \|PC\|^2\beta_n^2\bar L^2+\frac{4\|PC\|^2}{\lambda} $, which indicates that $ z(t) $ maintains bounded on interval $ [0,T_m) $. Integrating (10) from $ 0 $ to t, $ \forall t\in[0,T_m) $, we obtain $ V_z(t)-V_z(0) \leq- $ $\lambda \int_{0}^{t} V_z(s){d}s +4 \|PC\|^2\beta_n^2\bar L \int_{0}^{t} \dot L(s){d} s +4\|PC\|^2 \int_{0}^{t} \frac{1}{e^{2\alpha s}}{d}s$, which derives
\begin{eqnarray*} \lambda \int_{0}^{t} V_z(s){d}s \leq 4\beta_n^2\|PC\|^2\bar L^2+\frac{2\|PC\|^2}{\alpha}+V_z(0)<+\infty. \end{eqnarray*} |
Then, from $ V_z = z^{T} Pz $, one gets $ \lim_{t\to T_m}\int_0^{t}\|z(s)\|^2{d}s<+\infty $.
2) $ \varepsilon(t) $ is bounded and quadratic integrable for any $ t\in[0,T_m) $.
Construct scaling observer error
\begin{eqnarray} \xi_i = \frac{x_i-\hat{x}_i}{(L^*)^i}, \quad i = 1,\ldots,n \end{eqnarray} | (11) |
with a design parameter $ L^* $. Let $ \xi = [\xi_1,\ldots,\xi_n]^{T} $. Then, (1), (2) and (11) imply $ \dot\xi = L^*A\xi+L^*a\xi_1-L\Lambda a\xi_1+\frac{1}{\theta_1}L\Lambda a\frac{y}{L^*}+\tilde g^* $ with $\tilde g^* = \big[\frac{g_1}{L^*},\ldots, \frac{g_n}{(L^*)^n}\big]^{T}$ and $ \Lambda = {{\rm{diag}}}\big\{1,\frac{L}{L^*},\ldots,(\frac{L}{L^*})^{n-1}\big\} $. Derivate the candidate Lyapunov function $ V_\xi = \xi^{T} P\xi $. One obtains
\begin{split} D^+V_\xi =\; & L^*\xi^{T}(A^{T} P+PA)\xi+2L^*\xi_1\xi^{T} P a-2L\xi_1\xi^{T} P\Lambda a\nonumber\cr & +\frac{2}{\theta_1}L\xi^{T}P\Lambda a\frac{y}{L^*}+2\xi^{T} P\tilde g^*. \end{split} |
Similar to the treatment of Proposition 1, it can be deduced that
\begin{align*} D^+V_\xi &\leq -(L^*-\Theta_2)\|\xi\|^2+c_1\left(\frac{|y|}{L}\right)^2 +c_2\sum\limits_{i = 2}^n\left(\frac{\hat x_i}{L^i}\right)^2 \end{align*} |
with $ c_1 $, $ c_2 $ and $ \Theta_2 $ being some positive constant. This, together with the choice of $ L^* $ ($ L^*>\max\{\Theta_2+1,\bar L\} $) and (3), suggests that
\begin{align} D^+V_\xi &\leq -2\lambda V_\xi+\max\{c_1,c_2\}\dot L. \end{align} | (12) |
Then, we get $ V_{\xi}(t) \leq \max\{c_1,c_2\}\bar L $, $ \forall t\in[0,T_m) $, which says that $ \xi(t) $ keeps bounded on $ [0,T_m) $. Noting $ \varepsilon_i = \frac{L^*}{L}\xi_i $ and the boundedness of L, it is clear that $ \varepsilon(t) $ stands bounded on $ [0,T_m) $. For any $ t\in $ $[0,T_m) $, integrate (12) from 0 to t. Then one obtains $V_\xi(t)-V_\xi(0) \leq $ $ -2\lambda\int_0^{t}V_\xi(s){d}s+\max\{c_1,c_2\}\bar L$, which yields
\begin{eqnarray*} 2\lambda\int_0^{t}V_\xi(s){d}s \leq V_\xi(0)+\max\{c_1,c_2\}\bar L<+\infty. \end{eqnarray*} |
Thus, by $ V_{\xi} = \xi^{T} P\xi $, it can be derived $ \lim_{t\to T_m}\int_0^{t}\|\xi(s)\|^2{d}s<+\infty $. Noting $ \varepsilon_i = \frac{L^*}{L}\xi_i $ and the boundedness of L again, one sees that $\lim_{t\to T_m}\int_0^{t}\|\varepsilon(s)\|^2{d}s < +\infty$.
Proposition 3: The boundedness of all resulting closed-loop signals means $ T_m = +\infty $ and no Zeno phenomenon occurs. Besides, as t tends to infinity, $ (x(t),\hat x(t),u(t)) $ tends to zero.
Proof: By contradiction, suppose $ T_m<+\infty $. Together with the boundedness of the closed-loop signals, it indicates that Zeno occurs, i.e., there exists an infinite time sequence $ \{t_k\} $’s in $ [0,T_m) $ such that $ \lim_{k\to+\infty}t_k = T_m $.
Note the boundedness of the signals, which, together with (2)–(5), implies the existence of a constant $ M>0 $ such that $\big|D^+\big(e^{2\alpha t}(u(t)- $ $\omega(t))^2\big)\big|\nonumber \; \leq\; 2\big|u(t)-\omega(t)\big|\cdot\big|D^+\omega(t)\big|e^{2\alpha t}+2\alpha \big(u(t)-\omega(t)\big)^2e^{2\alpha t} \; \leq\; Me^{\alpha t}. $ Then, we have
\begin{equation} \lim\limits_{t\rightarrow t_{k+1}} \int_{t_k}^t D^+\big(e^{2\alpha s}(u(\tau)-\omega(s))^2\big){d}s \leq \frac{M}{\alpha}\big(e^{\alpha t_{k+1}}-e^{\alpha t_k}\big). \end{equation} | (13) |
On the other hand, according to event-triggering mechanism (5),
\begin{equation*} 1 = \lim\limits_{t\rightarrow t_{k+1}}\big(u(t)-\omega(t)\big)^2e^{2\alpha t} -\big(u(t_k)-\omega(t_k)\big)^2e^{2\alpha t_k} \end{equation*} |
which together with (13), means $ 1\leq\frac{M}{\alpha}\big(e^{\alpha t_{k+1}}-e^{\alpha t_k}\big) $. Then, Lagrange mean value theorem implies the existence of $ \beta_k\in[t_k,t_{k+1}) $ such that $ Me^{\alpha\beta_k}(t_{k+1}-t_k)\geq 1 $, i.e., $ t_{k+1}-t_k\geq\frac{1}{Me^{\alpha\beta_k}}>\frac{1}{Me^{\alpha T_m}}>0 $ since $ T_m< +\infty $. However, from this, it follows $ \lim_{k\to+\infty}t_k = +\infty $, which is a contradiction. Thus, we conclude $ T_m = +\infty $ and there is no Zeno phenomenon.
It remains to prove that system states and control signal converge to zero. Since the closed-loop signals are bounded, which, together with (7), suggests $ D^+z $ and $ D^+\varepsilon $ hold boundedness on $ [0,+\infty) $. Additionally, Proposition 2 indicates
\begin{eqnarray*} \lim_{t\to+\infty}\int_0^{t}(\|\varepsilon(s)\|^2+\|z(s)\|^2){d} s < +\infty. \end{eqnarray*} |
Then, one obtains $ \lim_{t\to+\infty}(\varepsilon(t),z(t)) = (0,0) $ from Barbălat Lemma [14]. Combining (6) with $ L(t)\geq1 $, it holds that $ \lim_{t\to+\infty}(x(t),\hat{x}(t)) = (0,0) $. Since on interval $ [0,+\infty) $, all closed-loop signals keep bounded, which, together with (4) and (9), implies $ \lim_{t\to+\infty}u(t) = 0 $.
The following theorem summarizes the main result of this letter, which establishes the conditions for the closed-loop signals to be bounded and convergent on the existence interval of the solution.
Theorem 1: With Assumptions 1 and 2 imposed on system (1), design output feedback control (4) under event-triggering mechanism (5), combined with state observer (2) and dynamic high gain (3). Then, the resulting closed-loop system is globally bounded while $ \lim_{t\to+\infty}(x(t),\hat x(t),u(t)) = (0,0,0) $. Besides, the Zeno phenomenon does not occur.
Proof: For any $ (x_0,\hat x_0) $, as mentioned at the beginning of this part, the unique solution exists on $ [0,T_m) $.
From Propositions 2 and 3, it follows that to finish the proof of the theorem, we only need to verify that gain $ L(t) $ remains bounded on $ [0,T_m) $. Contradictory, assume that $ L(t) $ can be unbounded on $ [0,T_m) $. Then, from the nondecreasing property of the gain, one obtains $ \lim_{t\to T_m}L(t) = +\infty $, which suggests the existence of $ T_1\in(0,T_m) $ such that $ L(t)\geq\Theta_3, \forall t\in[T_1,T_m) $ for some $ \Theta_3 $.
Take candidate Lyapunov function as $ V = (n+1)V_{\varepsilon}+V_n $. Then, with similar to the process of (48) in [7], we get
\begin{eqnarray} D^+V\leq-\|\varepsilon\|^2-\|\eta\|^2, \quad \forall t\in[T_1, T_m). \end{eqnarray} | (14) |
On the other hand, $ \dot L = \eta_1^2+\sum_{i = 2}^n(\eta_i-\beta_{i-1}\eta_{i-1})^2\leq\bar\beta\|\eta\|^2 $, which, together with (14), indicates that
\begin{align*} +\infty & = L(T_m)-L(T_1) = \int_{T_1}^{T_m}\dot Ldt \leq \int_{T_1}^{T_m}\bar\beta\|\eta\|^2dt \nonumber \cr &\leq \bar\beta V(T_1) <+\infty. \end{align*} |
The contradiction shows that $ L(t) $ must be bounded on $ [0,T_m) $.
Numerical example: A controlled pendulum system in the following form is considered to illustrate the effectiveness of our design approach above:
\begin{equation} \left\{ \begin{aligned} &\dot{x}_1 = x_2\cr &\dot{x}_2 = u-mg\sin\frac{x_1}{ml}-\frac{k}{m}x_2\cr &y = \theta x_1. \end{aligned} \right. \end{equation} | (15) |
Parameters m and l represent mass and length, respectively, g denotes gravitational acceleration and k is the friction coefficient, which is commonly an unknown constant.
Assume that $ 1.25\leq\theta\leq1.3 $. Obviously, pendulum system (15) satisfies Assumptions 1 and 2. Let $ m = 2 $, $ l = 0.5 $, $ k = 2 $ and $ g = 9.8 $. Put the initial system states as $ [-0.1,0.2]^{T} $ and the initial observer states as $ [0.2,0.1]^{T} $. Select the design parameters in observer (2) as $ a_1 = 25 $, $ a_2 = 17 $. Solve inequality (8) and we obtain $ P = \big[ \begin{smallmatrix} \; \; 0.5389 & -0.7109 \cr -0.7109 & \; \; 1.0764 \end{smallmatrix} \big]. $ Thus, following the previous design process, $ \frac{2\|Pa\|^2}{\underline\theta^2} = 2.82 $, $ b_1 = 1.27 $, $ \beta_1 = 9.39 $, $ r_2 = 44.06 $, $ b_2 = 3.93 $. Hereinto, the parameter in event-triggering mechanism (5) is selected as $ \alpha = 1 $. By utilizing MATLAB, one obtains the system evolution shown in Fig. 1. As such, the designed event-triggered control makes system states stay bounded and convergent to zero, and no Zeno phenomenon occurs.
Conclusion: Global event-triggered stabilization of nonlinear systems is addressed for uncertainties in both system nonlinearities and measurement sensitivity. For this purpose, a new design for the state observer and dynamic high gain is conducted by utilizing the system output and observer states. An effective event-triggered control in the case of output feedback is proposed by introducing certain auxiliary parameters. It synthesizes the implications of large uncertainties, unknown output, and the execution error to guarantee global stabilization. Future work might be directed towards more general systems such as those with polynomial-of-output growth.
Acknowledgments: This work was supported by the National Natural Science Foundation of China (62203283), Shandong Provincial Natural Science Foundation (ZR2022QF009, ZR2023QA063), and the China Postdoctoral Science Foundation (2022M711981).
[1] |
W.Herroelen and R.Leus, "Project scheduling under uncertainty:Survey and research potentials, "Eur.J.Oper.Res., vol.165, no.2, pp.289-306, Sep.2005. http://www.sciencedirect.com/science/article/pii/S0377221704002401
|
[2] |
I.Sabuncuoglu and S.Goren, "Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research, "Int.J.Comput.Integr.Manuf., vol.22, no.2, pp.138-157, Feb.2009. doi: 10.1080/09511920802209033
|
[3] |
J.M.Mulvey, R.J.Vanderbei, and S.A.Zenios, "Robust optimization of large-scale systems, "Oper.Res., vol.43, no.2, pp.264-281, Apr.1995. http://www.sciencedirect.com/science/article/pii/S0360544212007736
|
[4] |
P.Kouvelis and G.Yu, Robust Discrete Optimization and Its Applications. Norwell, MA:Kluwer Academic Publisher, 1997.
|
[5] |
Z.K.Li and M.G.Ierapetritou, "Robust optimization for process scheduling under uncertainty", Ind.Eng.Chem.Res., vol.47, no.12, pp.4148-4157, May 2008. http://cat.inist.fr/?aModele=afficheN&cpsidt=20426537
|
[6] |
A.D.Che, J.Feng, H.Chen, and C.Chu, "Robust optimization for the cyclic hoist scheduling problem, "Eur.J.Oper.Res., vol.240, no.3, pp.627-636, 2015. http://www.sciencedirect.com/science/article/pii/S0377221714005505
|
[7] |
Z.Q.Chang, S.J.Song, Y.L.Zhang, "Distributionally robust single machine scheduling with risk aversion, "Eur.J.Oper.Res., to be published. http://www.sciencedirect.com/science/article/pii/S0377221716304453
|
[8] |
M.Pinedo, "Minimizing the expected makespan in stochastic flow shops, "Oper.Res., vol.30, no.1, pp.148-162, Feb.1982. http://dl.acm.org/citation.cfm?id=2772472
|
[9] |
S.D.Wu, E.S.Byeon, and R.H.Storer, "A Graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness, "Oper.Res., vol.47, no.1, pp.113-124, Jan.1999.
|
[10] |
X.X.Lin, S.L.Janak, and C.A.Floudas, "A new robust optimization approach for scheduling under uncertainty:I.bounded uncertainty, Comp.Chem.Eng., vol.28, no.6-7, pp.1069-1085, Jun.2004. http://www.doc88.com/p-2985317973017.html
|
[11] |
A.L.Soyster, "Convex programming with set-inclusive constraints and applications to inexact linear programming, "Oper.Res., vol.21, no.5, pp.1154-1157, Oct.1973. http://industry.wanfangdata.com.cn/dl/Detail/ExternalResource?id=gdyjs201507014%5e22
|
[12] |
A.Ben-Tal and A.Nemirovski, "Robust solutions of uncertain linear programs, "Oper.Res.Lett., vol.25, no.1, pp.1-13, Aug.1999. http://www.sciencedirect.com/science/article/pii/S0167637799000164
|
[13] |
D.Bertsimas and M.Sim, "Robust discrete optimization and network flows, "Math.Program., vol.98, no.1-3, pp.49-71, Sep.2003. doi: 10.1007%2Fs10107-003-0396-4
|
[14] |
R.L.Daniels and P.Kouvelis, "Robust scheduling to hedge against processing time uncertainty in single-stage production, "Manag.Sci., vol.41, no.2, pp.363-376, Feb.1995. http://dl.acm.org/citation.cfm?id=2827855
|
[15] |
P.Kouvelis, R.L.Daniels, and G.Vairaktarakis, "Robust scheduling of a two-machine flow shop with uncertain processing times, "ⅡE Trans., vol.32, no.5, pp.421-432, May 2000.
|
[16] |
C.Artigues, J.C.Billaut, and C.Esswein, "Maximization of solution flexibility for robust shop scheduling, "Eur.J.Oper.Res., vol.165, no.2, pp.314-328, Sep.2005. http://www.sciencedirect.com/science/article/pii/S0377221704002425
|
[17] |
R.L.Daniels and J.E.Carrillo, "beta-robust scheduling for singlemachine systems with uncertain processing times, "ⅡE Trans., vol.29, no.11, pp.977-985, Nov.1997.
|
[18] |
B.Wang, X.F.Yang, and Q.Y.Li, "Bad-scenario set based riskresisting robust scheduling model, "Acta Automat.Sin., vol.38, no.2, pp.270-278, Feb.2012. http://en.cnki.com.cn/Article_en/CJFDTOTAL-MOTO201202014.htm
|
[19] |
C.W.Wu, K.N.Brown, and J.C.Beck, "Scheduling with uncertain durations:modeling beta-robust scheduling with constraints, "Comput. Oper.Res., vol.36, no.8, pp.2348-2356, Aug.2009. http://www.sciencedirect.com/science/article/pii/S0305054808001469
|
[20] |
P.Kouvelis, A.A.Kurawarwala, and G.J.Gutierrez, "Algorithms for robust single and multiple period layout planning for manufacturing systems, "Eur.J.Oper.Res., vol.63, no.2, pp.287-303, Feb.1992. https://utexas.influuent.utsystem.edu/en/publications/algorithms-for-robust-single-and-multiple-period-layout-planning-
|
[21] |
T.Assavapokee, M.J.Realff, J.C.Ammons, and I.H.Hong, "Scenario relaxation algorithm for finite scenario-based minCmax regret and minCmax relative regret robust optimization, "Comput.Oper.Res., vol.35, no.6, pp.2093-2102, Jun.2008. http://www.sciencedirect.com/science/article/pii/S0305054806002735
|
[22] |
M.A.Al-Fawzan and M.Haouari, "A bi-objective model for robust resource-constrained project scheduling, "Int.J.Prod.Econ., vol.96, no.2, pp.175-187, May 2005. http://www.sciencedirect.com/science/article/pii/S0925527304001458
|
[23] |
R.Qing-dao-er-ji, Y.P.Wang, and X.L.Wang, "Inventory based twoobjective job shop scheduling model and its hybrid genetic algorithm, Appl.Soft Comput., vol.13, no.3, pp.1400-1406, Mar.2013. http://www.sciencedirect.com/science/article/pii/S1568494612001883
|
[24] |
D.M.Lei, "Simplified multi-objective genetic algorithms for stochastic job shop scheduling, "Appl.Soft Comput., vol.11, no.8, pp.4991-4996, Dec.2011. http://www.sciencedirect.com/science/article/pii/S1568494611002195
|
[25] |
A.S.Jain and S.Meeran, "Deterministic job-shop scheduling:past, present and future, "Eur.J.Oper.Res., vol.113, no.2, pp.390-434, Mar.1999. http://www.academia.edu/5906092/Deterministic_job-shop_scheduling_Past_present_and_future
|
[26] |
C.Y.Zhang, P.G.Li, Z.L.Guan, and Y.Q.Rao, "A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, "Comput.Oper.Res., vol.34, no.11, pp.3229-3242, Nov.2007. http://dl.acm.org/citation.cfm?id=1934910.1935572
|
[27] |
V.J.Leon, S.D.Wu, and R.H.Storer, "Robustness measures and robust scheduling for job shops, "ⅡE Trans., vol.26, no.5, pp.32-43, Sep.1994. http://citeseerx.ist.psu.edu/showciting?cid=805716
|
[28] |
E.S.Byeon, S.D.Wu, and R.H.Storer, "Decomposition heuristics for robust job-shop scheduling, "IEEE Trans.Rob.Automat., vol.14, no.2, pp.303-313, Apr.1998.
|
[29] |
E.Kutanoglu and I.Sabuncuoglu, "Experimental investigation of iterative simulation-based scheduling in a dynamic and stochastic job shop, J.Manuf.Syst., vol.20, no.4, pp.264-279, Jan.2001. http://www.sciencedirect.com/science/article/pii/S0278612501800467
|
[30] |
M.T.Jensen, "Generating robust and flexible job shop schedules using genetic algorithms, "IEEE Trans.Evol.Comput., vol.7, no.3, pp.275-288, Jun.2003. http://citeseerx.ist.psu.edu/showciting?cid=789621
|
[31] |
S.V.Mehta and R.M.Uzsoy, "Predictable scheduling of a job shop subject to breakdowns, "IEEE Trans.Rob.Automat., vol.14, no.3, pp.365-378, 1998. http://ieeexplore.ieee.org/document/678447/
|
[32] |
M.Sakawa and R.Kubota, "Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms, "Eur.J.Oper.Res., vol.120, no.2, pp.393-407, Jan.2000. http://www.sciencedirect.com/science/article/pii/S0377221799000946
|
[33] |
J.K.Lenstra and A.H.G.R.Kan, "Computational complexity of discrete optimization problems, "Ann.Discrete Math., vol.4, pp.121-140, Dec.1979. http://www.sciencedirect.com/science/article/pii/S0167506008708215
|
[34] |
B.Wang, X.F.Yang, and Q.Y.Li, "Genetic simulated-annealing algorithm for robust job shop scheduling, "in Fuzzy Information and Engineering, Vol.2:Advances in Intelligent and Soft Computing, B.Y. Cao, T.F.Li, and C.Y.Zhang, Eds.Berlin Heidelberg:Springer, 2009, pp.817-827. http://www.academia.edu/16003762/Genetic_Simulated_annealing_Algorithm
|
[35] |
L.Wang and D.Z.Zheng, "An effective hybrid optimization strategy for job-shop scheduling problems, "Comput.Oper.Res., vol.28, no.6, pp.585-596, May 2001. http://www.sciencedirect.com/science/article/pii/S0305054899001379
|
[36] |
B.Wang, J.Liu, and Y.Y.Yu, "Scenarios based Tabu search algorithm for robust job-shop scheduling, "in The Proc.Chinese Control Conf., Xi'an, China, 2013, pp.2491-2496. http://ieeexplore.ieee.org/iel7/6621666/6639389/06639845.pdf?arnumber=6639845
|
[37] |
J.F.Muth and C.L.Thompson, Industrial Scheduling, Englewood Cliffs, NJ:Prentice-Hall, 1963.
|