检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:XudongLi FengshengTu YongjianLi XiaoqiangCai
机构地区:[1]DepartmentofAutomation,NankaiUniversity,Tianjin300071,China [2]SchoolofEconomicsandManagement,TsinghuaUniversity,Beijing100084,China [3]DepartmentofSystemEngineering&EngineeringManagement,TheChineseUniversityofHongKong,ShatinN.T.,HONGKONG
出 处:《Journal of Systems Science and Information》2004年第3期545-556,共12页系统科学与信息学报(英文)
摘 要:We consider a manpower planning problem with single employee type over a long planning horizon and analyze the optimal recruitment and dismissal polices. Dynamic demands for manpower must be fulfilled by allocating enough number of employees. Costs for every employee include salary, recruitment and dismissal costs, in particular, setup costs when recruitment/dismissal activities occur. We formulate the problem as a multi-period decision model. Then we analyze properties of the problem and give an improved dynamic programming algorithm to minimize the total cost over the entire planning horizon. We report computational results to illustrate the effectiveness of the approach.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38