维普期刊资源整合服务平台（V6.5）

58篇 您的检索式：作者名="LEISTEN R"

选中清除导出查看参考文献查看引证文献引用追踪共3页首页上一页第1页下一页末页 /3 跳转

	题名	作者	年代	出处	被引量
1	An efficient constructive heuristic for flowtime minimisation in permutation flow shops 显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1
2	3D co-culture of hematopoietic stem and progenitor cells and mesenchymal stem cells in collagen scaffolds as a model of the hematopoietic niche显示文摘	Leisten I Kramann R Ventura Ferreira MS	2012	Biomaterials2012，33，6：	1
3	Flowshop sequencing problems with limited buffer storage 显示文摘	LEISTEN R	1990	International Journal of Production Research1990，28，11：	1
4	Efficient heuristics for flow shop sequencing with the objectives of makespan and flowtime minimization显示文摘	Framinan J M Leisten R Ruiz-usano R	2002	European Journal of Operational Research2002，141，3：	1
5	Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective显示文摘	Ribas I Leisten R Framifian J M	2010	Computers 8z Operations Research2010，37，8：	1
6	A review and classification of heuristics for permutation flowshop scheduling with makespan objective显示文摘	Framinan J M Gupta J N D Leisten R	2004	J of the Operational Research Society2004，55，12：	1
7	A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness显示文摘	Framinan J Leisten R	2006	International Journal of Production Economics2006，99，：	1
8	Flowshop sequencing problems with limited buffer storage显示文摘	LEISTEN R	1990	International Journal of Production Re- search1990，28，11：	1
9	An efficient constructive heuristic for flowtime minimisation in permutation flow shops显示文摘	Framinan J M Leisten R	2003	OMEGA2003，3，4：	1
10	An efficient constructive heuristic for flowtime minimization in permutation flow shops显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1
11	Different initial sequences for the heuristic of nawaz, enscore and ham to minimize Makespan, idletime or flowtime in the static permutation flowshop sequencing problem显示文摘	Framinan J M Leisten R Rajendran C	2003	International Journal of Production Research2003，41，1：	1
12	Flow Shop Sequencing Problems with Limited Buffer Storage 显示文摘	Leisten R	1990	International Journal of Production Research1990，28，2：	1
13	A Review and Classifica- tion of Heuristics for Permutation Flow-Shop Scheduling with Makespan Objective显示文摘	Framinan J M Gupta J N D Leisten R	2004	Journal of the Operational Research So- ciety2004，55，12：	1
14	An efficient constructive heuristic for flowtime minimisation in permuta- tion flow shops 显示文摘	Framinan JM Leisten R	2003	Omega2003，31，4：	1
15	An efficient constructive heuristic for flowtime minimisation in permutation flow shops显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1
16	An efficient constructive heuristic for flowtime minimization in permutation flow shops显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1
17	Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idle time or flowtime in the static permutation flowshop sequencing problem 显示文摘	Framinan J M Leisten R Rajendran C	2003	International Journal of production Research2003，41，1：	1
18	An efficient constructive heuristic for flowtime minimisation in permutation flow shops显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1
19	Management of leg and pressure ulcer in hospitalized patients:direct costs are lower than expected显示文摘	Assadian O 0swald JS Leisten R	2011	GMS Krankenhaushygiene Interdisziplinr2011，6，1：	1
20	An efficient constructive heuristic for flowtime minimisation in permutation flow shops显示文摘	FRAMINAN J M LEISTEN R	2003	Omega2003，31，4：	1

返回顶部每页显示：

共3页首页上一页第1页下一页末页 /3 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示