The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job ther...The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.展开更多
Using Time-Varying AR (TVAR) model and adaptive notch filter is a new method for the non-stationary jammer suppression in Direct Sequence Spread Spectrum (DSSS). The performance of TVAR model for Instantaneous Frequen...Using Time-Varying AR (TVAR) model and adaptive notch filter is a new method for the non-stationary jammer suppression in Direct Sequence Spread Spectrum (DSSS). The performance of TVAR model for Instantaneous Frequency (IF) estimation will be affected by some factors such as basis functions. Focusing on this problem, the optimal basis function of TVAR model for the IF estimation of the LFM signal is obtained in this paper. Besides the depth and width of notching, the phase properties of notch filter affect the Signal-to-Interference plus-Noise Ratio (SINR) of correlation output to the narrowband jammer suppression in DSSS, in response to the problem the closed solution of correlation output SINR improvement has been derived when a single frequency jammer passes through direct IIR notch filter, and its performance has been compared with those of five coefficient FIR filters. Later, a novel method for LFM jammer suppression based on Fourier basis TVAR model and direct IIR notch filter is proposed. The simulation results show the effectiveness of the proposed method.展开更多
In this paper,we are concerned with the asymptotic behavior,as u→∞,of P{sup_t∈|0,T|X_u(t)>u},where X_u(t),t∈|0,T|,u>0 is a family of centered Gaussian processes with continuous trajectories.A key application...In this paper,we are concerned with the asymptotic behavior,as u→∞,of P{sup_t∈|0,T|X_u(t)>u},where X_u(t),t∈|0,T|,u>0 is a family of centered Gaussian processes with continuous trajectories.A key application of our findings concerns P{sup_t∈|0,T|(X(t)+g(t))>u},as u→∞,for X a centered Gaussian process and g some measurable trend function.Further applications include the approximation of both the ruin time and the ruin probability of the Brownian motion risk model with constant force of interest.展开更多
文摘The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.
基金Supported by the Natural Science Foundation of Hebei Province (F2010000442)
文摘Using Time-Varying AR (TVAR) model and adaptive notch filter is a new method for the non-stationary jammer suppression in Direct Sequence Spread Spectrum (DSSS). The performance of TVAR model for Instantaneous Frequency (IF) estimation will be affected by some factors such as basis functions. Focusing on this problem, the optimal basis function of TVAR model for the IF estimation of the LFM signal is obtained in this paper. Besides the depth and width of notching, the phase properties of notch filter affect the Signal-to-Interference plus-Noise Ratio (SINR) of correlation output to the narrowband jammer suppression in DSSS, in response to the problem the closed solution of correlation output SINR improvement has been derived when a single frequency jammer passes through direct IIR notch filter, and its performance has been compared with those of five coefficient FIR filters. Later, a novel method for LFM jammer suppression based on Fourier basis TVAR model and direct IIR notch filter is proposed. The simulation results show the effectiveness of the proposed method.
基金supported by Swiss National Science Foundation (Grant No. 200021166274)the National Science Centre (Poland) (Grant No. 2015/17/B/ST1/01102) (2016–2019)
文摘In this paper,we are concerned with the asymptotic behavior,as u→∞,of P{sup_t∈|0,T|X_u(t)>u},where X_u(t),t∈|0,T|,u>0 is a family of centered Gaussian processes with continuous trajectories.A key application of our findings concerns P{sup_t∈|0,T|(X(t)+g(t))>u},as u→∞,for X a centered Gaussian process and g some measurable trend function.Further applications include the approximation of both the ruin time and the ruin probability of the Brownian motion risk model with constant force of interest.
