To improve the efficiency of operating rooms, reduce the hospital＇ s costs and improve the level of service qualities, a scheduling method is presented based on a filtered-beam-search-based algo- rithm. Firstly, a sc...To improve the efficiency of operating rooms, reduce the hospital＇ s costs and improve the level of service qualities, a scheduling method is presented based on a filtered-beam-search-based algo- rithm. Firstly, a scheduling problem domain is described. Mathematical programming models are al- so set up with an objective function of minimizing related costs of the system. On the basis of the de= scriptions mentioned above, a solving policy of generating feasible scheduling solutions is estab- lished. Combining with the speeific constraints of operation theatres, a filtered-beam-search-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed. The performance of the proposed algorithm is evaluated and compared with that of other approaches through simulations. Results indicate that the proposed algorithm can reduce costs, and are of prac- ticality and effectiveness.展开更多
To support the rapid automatic services composition and fulfill multi-quality of service （multi- QoS） demand, we propose a novel approach to realize services composition automatically by a prefihering process. Aimed...To support the rapid automatic services composition and fulfill multi-quality of service （multi- QoS） demand, we propose a novel approach to realize services composition automatically by a prefihering process. Aimed at a set of web services with similar functionality and different quality of service （QoS） , a semantic services chain is given and a corresponding constructing algorithm is proposed to construct the data structure. A pre-filtering process is put forward to find whether a composition service before planning exists. It can avoid aborted planning. An optimal planning algorithm is proposed which can choose the most suitable service from a lot of similar candidate services based on semantic service chains and multi-QoS values. The algorithms can improve the correctness and automation performances of automated semantic web services composition. As an example, a concrete composite process is analyzed. Experimental results show the validity of the composite process.展开更多
This paper presents a new nonmonotone filter line search technique in association with the MBFGS method for solving unconstrained minimization.The filter method,which is traditionally used for constrained nonlinear pr...This paper presents a new nonmonotone filter line search technique in association with the MBFGS method for solving unconstrained minimization.The filter method,which is traditionally used for constrained nonlinear programming(NLP),is extended to solve unconstrained NLP by converting the latter to an equality constrained minimization.The nonmonotone idea is employed to the filter method so that the restoration phrase,a common feature of most filter methods,is not needed.The global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions.The results of numerical experiments indicate that the proposed method is efficient.展开更多
基金Supported by the National Natural Science Foundation of China(No.61273035,71471135)
文摘To improve the efficiency of operating rooms, reduce the hospital＇ s costs and improve the level of service qualities, a scheduling method is presented based on a filtered-beam-search-based algo- rithm. Firstly, a scheduling problem domain is described. Mathematical programming models are al- so set up with an objective function of minimizing related costs of the system. On the basis of the de= scriptions mentioned above, a solving policy of generating feasible scheduling solutions is estab- lished. Combining with the speeific constraints of operation theatres, a filtered-beam-search-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed. The performance of the proposed algorithm is evaluated and compared with that of other approaches through simulations. Results indicate that the proposed algorithm can reduce costs, and are of prac- ticality and effectiveness.
基金Supported by the National Natural Science Foundation of China （No. 61201252, 60775037） , Humanities and Social Sciences Foundation of the Ministry of Education （No. 10YJC870046 ）, Natural Science Research Key Project of Anhui Provincial Higher Education （No. KJ2011 A128） , Soft Science Project of Anhui Province （ No. 11020503009）.
文摘To support the rapid automatic services composition and fulfill multi-quality of service （multi- QoS） demand, we propose a novel approach to realize services composition automatically by a prefihering process. Aimed at a set of web services with similar functionality and different quality of service （QoS） , a semantic services chain is given and a corresponding constructing algorithm is proposed to construct the data structure. A pre-filtering process is put forward to find whether a composition service before planning exists. It can avoid aborted planning. An optimal planning algorithm is proposed which can choose the most suitable service from a lot of similar candidate services based on semantic service chains and multi-QoS values. The algorithms can improve the correctness and automation performances of automated semantic web services composition. As an example, a concrete composite process is analyzed. Experimental results show the validity of the composite process.
基金supported by the National Science Foundation under Grant No.11371253the Science Foundation under Grant No.11C0336 of Provincial Education Department of Hunan
文摘This paper presents a new nonmonotone filter line search technique in association with the MBFGS method for solving unconstrained minimization.The filter method,which is traditionally used for constrained nonlinear programming(NLP),is extended to solve unconstrained NLP by converting the latter to an equality constrained minimization.The nonmonotone idea is employed to the filter method so that the restoration phrase,a common feature of most filter methods,is not needed.The global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions.The results of numerical experiments indicate that the proposed method is efficient.
