A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespa...A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespan and an LPT-LS algorithm is proposed.Non-resumable jobs are first scheduled in a machine by the longest processing time（LPT） rule,and then resumable jobs are scheduled by the list scheduling（LS） rule.And the worst-case ratios of this algorithm in three different cases in terms of the value of the total processing time of the resumable jobs（denoted as S2） are discussed.When S2 is longer than the spare time of the machine after the non-resumable jobs are assigned by the LPT rule,it is equal to 1.When S2 falls in between the spare time of the machine by the LPT rule and the optimal schedule rule,it is less than 2.When S2 is less than the spare time of the machine by the optimal schedule rule,it is less than 2.Finally,numerical examples are presented for verification.展开更多
In this paper,we consider a wireless ad hoc network consisting of multiple source nodes transmitting to their respective destinations,where an eavesdropper attempts to intercept their transmissions.We propose an optim...In this paper,we consider a wireless ad hoc network consisting of multiple source nodes transmitting to their respective destinations,where an eavesdropper attempts to intercept their transmissions.We propose an optimal transmission scheduling scheme to defend against the eavesdropper,where a source node having the highest secrecy rate is scheduled to access the wireless medium for transmitting to its destination in an opportunistic manner.To be specific,the secrecy rate between a pair of the source and destination in the presence of an eavesdropper varies temporally due to the wireless fading effect.The proposed optimal transmission scheduling scheme opportunistically selects a source node with the highest secrecy rate to transmit its data for the sake of maximizing the security of the ad hoc network against eavesdropping attacks.For comparison purposes,we also consider the conventional round-robin scheduling as a benchmark,where multiple source nodes take turns in accessing their shared wireless medium for transmitting to their respective destinations.We derive closed-form secrecy outage probability expressions of both the round-robin scheduling and the proposed optimal scheduling schemes over Rayleigh fading environments.Numerical results show that the proposed transmission scheduling scheme outperforms the conventional round-robin method in terms of its secrecy outage probability.Additionally,upon increasing the number of source-destination pairs,the secrecy outage probability of the round-robin scheme keeps unchanged,whereas the secrecy outage performance of the proposed transmission scheduling significantly improves,showing the security benefits of exploiting transmission scheduling for protecting wireless ad hoc networks against eavesdropping.展开更多
基金The National Natural Science Foundation of China (No.70971022,71271054)the Scientific Research Innovation Project for College Graduates in Jiangsu Province(No.CXLX_0157)the Scientific Research Foundation of the Education Department of Anhui Province(No.2011sk123)
文摘A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespan and an LPT-LS algorithm is proposed.Non-resumable jobs are first scheduled in a machine by the longest processing time（LPT） rule,and then resumable jobs are scheduled by the list scheduling（LS） rule.And the worst-case ratios of this algorithm in three different cases in terms of the value of the total processing time of the resumable jobs（denoted as S2） are discussed.When S2 is longer than the spare time of the machine after the non-resumable jobs are assigned by the LPT rule,it is equal to 1.When S2 falls in between the spare time of the machine by the LPT rule and the optimal schedule rule,it is less than 2.When S2 is less than the spare time of the machine by the optimal schedule rule,it is less than 2.Finally,numerical examples are presented for verification.
基金supported by the Natural Science Foundation of Anhui Provincial Education Department under Grant No.KJ2013Z048the Natural Science Foundation of Anhui Provincial Colleges and Universities under Grant No.KJ2014A234
文摘In this paper,we consider a wireless ad hoc network consisting of multiple source nodes transmitting to their respective destinations,where an eavesdropper attempts to intercept their transmissions.We propose an optimal transmission scheduling scheme to defend against the eavesdropper,where a source node having the highest secrecy rate is scheduled to access the wireless medium for transmitting to its destination in an opportunistic manner.To be specific,the secrecy rate between a pair of the source and destination in the presence of an eavesdropper varies temporally due to the wireless fading effect.The proposed optimal transmission scheduling scheme opportunistically selects a source node with the highest secrecy rate to transmit its data for the sake of maximizing the security of the ad hoc network against eavesdropping attacks.For comparison purposes,we also consider the conventional round-robin scheduling as a benchmark,where multiple source nodes take turns in accessing their shared wireless medium for transmitting to their respective destinations.We derive closed-form secrecy outage probability expressions of both the round-robin scheduling and the proposed optimal scheduling schemes over Rayleigh fading environments.Numerical results show that the proposed transmission scheduling scheme outperforms the conventional round-robin method in terms of its secrecy outage probability.Additionally,upon increasing the number of source-destination pairs,the secrecy outage probability of the round-robin scheme keeps unchanged,whereas the secrecy outage performance of the proposed transmission scheduling significantly improves,showing the security benefits of exploiting transmission scheduling for protecting wireless ad hoc networks against eavesdropping.
