Previous studies done elsewhere have shown that Eucalyptus poles treated with chromated copper arsenate (CCA) can last over 30 years. Kenya is exceptional because in some eco-regions, the Eucalyptus poles’ life span ...Previous studies done elsewhere have shown that Eucalyptus poles treated with chromated copper arsenate (CCA) can last over 30 years. Kenya is exceptional because in some eco-regions, the Eucalyptus poles’ life span has greatly reduced to 5 years. The current study was designed to evaluate wood deteriorating agents of CCA-treated Eucalyptus poles and variability in four eco-regions of Kenya, namely, dryland, coastal, highland and humid lake. A total of 360 Eucalyptus pole samples were used for this experiment. Three CCA treatments were used to treat transmission poles at 20 kg/cm3 fencing posts samples at 6 kg/cm3, and a control group. Results indicated that termites and wood-decay fungi attacks caused wood deterioration in the four eco-regions. The proportion of power transmission pole degradation by wood deteriorating agents varied across eco-regions, between treatments and control and between time after treatments. Dryland eco-regions had the highest termite-related degradation (41.82%) while wood-decay fungi attack was highest in the highland eco-regions (9.20%). Samples treated with 6 kg/cm3 recorded the lowest level of wood deterioration, manifested by minimal superficial termite and wood-decay fungi attack. Samples treated with 20 kg/cm3 were characterized by moderate termite and wood-decay fungi attacks observed around the heartwood region, unlike sapwood. This study concluded that the deterioration of Eucalyptus CCA-treated poles is a question of climatic variability and hence, to increase the poles’ lifespan, CCA treatment should be tailored according to the characteristics of the ecoregion of use. Further investigations will inform the diversity of termites and decay-fungi across different eco-regions.展开更多
In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimizat...In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimization and maximum lateness minimization corresponding to the first and second special cases of our model under some agreeable conditions. However, corresponding to the third special case of our model, we show that the optimal schedules may be different from those of the classical version for the above objective functions.展开更多
This paper considers single-machine scheduling problems in group technology with the jobs' processing times being simple linear functions of their start times.The objective functions are the ~minimizing of makespa...This paper considers single-machine scheduling problems in group technology with the jobs' processing times being simple linear functions of their start times.The objective functions are the ~minimizing of makespan and total weighted completion time.Some optimal conditions and algorithms are given and the fact that the problem of total weighted completion times is NP-hard is proved.展开更多
We consider a scheduling problem involving a single processor utilized by two customers with constant deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times. Tradition...We consider a scheduling problem involving a single processor utilized by two customers with constant deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times. Traditionally, such scenarios are modeled by assuming that each customer has the same criterion. In practice, this assumption may not hold. Instead of using a single criterion, we examine the implications of minimizing an aggregate scheduling objective function in which jobs belonging to different customers are evaluated with their individual criteria. We examine three basic scheduling criteria： minimizing makespan, minimizing maximum lateness, and minimizing total weighted completion time. We demonstrate all the scheduling problems considered are polynomially solvable.展开更多
The permutation flow shop scheduling problems with deteriorating jobs and rejection on dominant machines were studied.The objectives are to minimize the makespan of scheduled jobs plus the total rejection penalty and ...The permutation flow shop scheduling problems with deteriorating jobs and rejection on dominant machines were studied.The objectives are to minimize the makespan of scheduled jobs plus the total rejection penalty and the total completion time of scheduled jobs plus the total rejection penalty.For each objective, polynomial time algorithms based on dynamic programming were presented.展开更多
Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical...Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical situations,it is found that some jobs fail to be processed prior to the pre-specified thresholds,and they often consume extra deteriorating time for successful accomplishment. Their processing times can be characterized by a step-wise function. Such kinds of jobs are called step-deteriorating jobs. In this paper,parallel machine scheduling problem with stepdeteriorating jobs( PMSD) is considered. Due to its intractability,four different mixed integer programming( MIP) models are formulated for solving the problem under consideration. The study aims to investigate the performance of these models and find promising optimization formulation to solve the largest possible problem instances. The proposed four models are solved by commercial software CPLEX. Moreover,the near-optimal solutions can be obtained by black-box local-search solver LocalS olver with the fourth one. The computational results show that the efficiencies of different MIP models depend on the distribution intervals of deteriorating thresholds, and the performance of LocalS olver is clearly better than that of CPLEX in terms of the quality of the solutions and the computational time.展开更多
Currently,energy conservation draws wide attention in industrial manufacturing systems.In recent years,many studies have aimed at saving energy consumption in the process of manufacturing and scheduling is regarded as...Currently,energy conservation draws wide attention in industrial manufacturing systems.In recent years,many studies have aimed at saving energy consumption in the process of manufacturing and scheduling is regarded as an effective approach.This paper puts forwards a multi-objective stochastic parallel machine scheduling problem with the consideration of deteriorating and learning effects.In it,the real processing time of jobs is calculated by using their processing speed and normal processing time.To describe this problem in a mathematical way,amultiobjective stochastic programming model aiming at realizing makespan and energy consumption minimization is formulated.Furthermore,we develop a multi-objective multi-verse optimization combined with a stochastic simulation method to deal with it.In this approach,the multi-verse optimization is adopted to find favorable solutions from the huge solution domain,while the stochastic simulation method is employed to assess them.By conducting comparison experiments on test problems,it can be verified that the developed approach has better performance in coping with the considered problem,compared to two classic multi-objective evolutionary algorithms.展开更多
三峡库区周期性水位升降引起的消落带岩体劣化对典型危岩岸坡稳定性具有重大影响。基于野外调研及地勘资料,采用通用离散单元法程序(universal distinct element code,简称UDEC)研究了消落带劣化区形态对近水平层状高陡危岩岸坡的稳定...三峡库区周期性水位升降引起的消落带岩体劣化对典型危岩岸坡稳定性具有重大影响。基于野外调研及地勘资料,采用通用离散单元法程序(universal distinct element code,简称UDEC)研究了消落带劣化区形态对近水平层状高陡危岩岸坡的稳定性影响。研究表明:目前三峡库区巫山段的近水平层状危岩岸坡消落带岩体劣化严重,在不同消落带劣化区存在紧密层状、松散碎裂状、溶蚀凹腔状、含挤压碎裂带等典型消落带劣化区形态;含有第1种消落带劣化区形态的危岩岸坡稳定性较好,危岩体位移较小,失稳模式为滑移破坏;含有第2种消落带劣化区形态的危岩岸坡危岩体先向坡内偏移,其后随着消落带岩体支撑强度弱化向坡外倾倒破坏;含有第3种消落带劣化区形态的危岩岸坡危岩体向坡外位移较大,失稳模式为倾倒破坏;含有第4种消落带劣化区形态的危岩岸坡稳定性主要受挤压破碎带的力学性质控制,易产生沿破碎带切割面的旋转滑移破坏;通过对以上4种劣化区形态的危岩岸坡增加防治加固措施,危岩体的变形位移得到了不同程度的有效控制。展开更多
文摘Previous studies done elsewhere have shown that Eucalyptus poles treated with chromated copper arsenate (CCA) can last over 30 years. Kenya is exceptional because in some eco-regions, the Eucalyptus poles’ life span has greatly reduced to 5 years. The current study was designed to evaluate wood deteriorating agents of CCA-treated Eucalyptus poles and variability in four eco-regions of Kenya, namely, dryland, coastal, highland and humid lake. A total of 360 Eucalyptus pole samples were used for this experiment. Three CCA treatments were used to treat transmission poles at 20 kg/cm3 fencing posts samples at 6 kg/cm3, and a control group. Results indicated that termites and wood-decay fungi attacks caused wood deterioration in the four eco-regions. The proportion of power transmission pole degradation by wood deteriorating agents varied across eco-regions, between treatments and control and between time after treatments. Dryland eco-regions had the highest termite-related degradation (41.82%) while wood-decay fungi attack was highest in the highland eco-regions (9.20%). Samples treated with 6 kg/cm3 recorded the lowest level of wood deterioration, manifested by minimal superficial termite and wood-decay fungi attack. Samples treated with 20 kg/cm3 were characterized by moderate termite and wood-decay fungi attacks observed around the heartwood region, unlike sapwood. This study concluded that the deterioration of Eucalyptus CCA-treated poles is a question of climatic variability and hence, to increase the poles’ lifespan, CCA treatment should be tailored according to the characteristics of the ecoregion of use. Further investigations will inform the diversity of termites and decay-fungi across different eco-regions.
文摘In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimization and maximum lateness minimization corresponding to the first and second special cases of our model under some agreeable conditions. However, corresponding to the third special case of our model, we show that the optimal schedules may be different from those of the classical version for the above objective functions.
文摘This paper considers single-machine scheduling problems in group technology with the jobs' processing times being simple linear functions of their start times.The objective functions are the ~minimizing of makespan and total weighted completion time.Some optimal conditions and algorithms are given and the fact that the problem of total weighted completion times is NP-hard is proved.
文摘We consider a scheduling problem involving a single processor utilized by two customers with constant deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times. Traditionally, such scenarios are modeled by assuming that each customer has the same criterion. In practice, this assumption may not hold. Instead of using a single criterion, we examine the implications of minimizing an aggregate scheduling objective function in which jobs belonging to different customers are evaluated with their individual criteria. We examine three basic scheduling criteria： minimizing makespan, minimizing maximum lateness, and minimizing total weighted completion time. We demonstrate all the scheduling problems considered are polynomially solvable.
文摘The permutation flow shop scheduling problems with deteriorating jobs and rejection on dominant machines were studied.The objectives are to minimize the makespan of scheduled jobs plus the total rejection penalty and the total completion time of scheduled jobs plus the total rejection penalty.For each objective, polynomial time algorithms based on dynamic programming were presented.
基金National Natural Science Foundation of China(No.51405403)the Fundamental Research Funds for the Central Universities,China(No.2682014BR019)the Scientific Research Program of Education Bureau of Sichuan Province,China(No.12ZB322)
文摘Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical situations,it is found that some jobs fail to be processed prior to the pre-specified thresholds,and they often consume extra deteriorating time for successful accomplishment. Their processing times can be characterized by a step-wise function. Such kinds of jobs are called step-deteriorating jobs. In this paper,parallel machine scheduling problem with stepdeteriorating jobs( PMSD) is considered. Due to its intractability,four different mixed integer programming( MIP) models are formulated for solving the problem under consideration. The study aims to investigate the performance of these models and find promising optimization formulation to solve the largest possible problem instances. The proposed four models are solved by commercial software CPLEX. Moreover,the near-optimal solutions can be obtained by black-box local-search solver LocalS olver with the fourth one. The computational results show that the efficiencies of different MIP models depend on the distribution intervals of deteriorating thresholds, and the performance of LocalS olver is clearly better than that of CPLEX in terms of the quality of the solutions and the computational time.
文摘Currently,energy conservation draws wide attention in industrial manufacturing systems.In recent years,many studies have aimed at saving energy consumption in the process of manufacturing and scheduling is regarded as an effective approach.This paper puts forwards a multi-objective stochastic parallel machine scheduling problem with the consideration of deteriorating and learning effects.In it,the real processing time of jobs is calculated by using their processing speed and normal processing time.To describe this problem in a mathematical way,amultiobjective stochastic programming model aiming at realizing makespan and energy consumption minimization is formulated.Furthermore,we develop a multi-objective multi-verse optimization combined with a stochastic simulation method to deal with it.In this approach,the multi-verse optimization is adopted to find favorable solutions from the huge solution domain,while the stochastic simulation method is employed to assess them.By conducting comparison experiments on test problems,it can be verified that the developed approach has better performance in coping with the considered problem,compared to two classic multi-objective evolutionary algorithms.
文摘三峡库区周期性水位升降引起的消落带岩体劣化对典型危岩岸坡稳定性具有重大影响。基于野外调研及地勘资料,采用通用离散单元法程序(universal distinct element code,简称UDEC)研究了消落带劣化区形态对近水平层状高陡危岩岸坡的稳定性影响。研究表明:目前三峡库区巫山段的近水平层状危岩岸坡消落带岩体劣化严重,在不同消落带劣化区存在紧密层状、松散碎裂状、溶蚀凹腔状、含挤压碎裂带等典型消落带劣化区形态;含有第1种消落带劣化区形态的危岩岸坡稳定性较好,危岩体位移较小,失稳模式为滑移破坏;含有第2种消落带劣化区形态的危岩岸坡危岩体先向坡内偏移,其后随着消落带岩体支撑强度弱化向坡外倾倒破坏;含有第3种消落带劣化区形态的危岩岸坡危岩体向坡外位移较大,失稳模式为倾倒破坏;含有第4种消落带劣化区形态的危岩岸坡稳定性主要受挤压破碎带的力学性质控制,易产生沿破碎带切割面的旋转滑移破坏;通过对以上4种劣化区形态的危岩岸坡增加防治加固措施,危岩体的变形位移得到了不同程度的有效控制。
