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

71篇 您的检索式：作者名="Framinan"

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

	题名	作者	年代	出处	被引量
1	An efficient constructive heuristic for flowtime minimisation in permutation flow shops 显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1
2	A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem显示文摘	Fernandez-Viagas V Framinan J M	2015	Int J of Production Research2015，53，4：	1
3	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
4	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
5	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
6	An efficient constructive heuristic for flowtime minimisation in permutation flow shops显示文摘	Framinan J M Leisten R	2003	OMEGA2003，3，4：	1
7	An efficient constructive heuristic for flowtime minimization in permutation flow shops显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1
8	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
9	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
10	An efficient constructive heuristic for flowtime minimisation in permuta- tion flow shops 显示文摘	Framinan JM Leisten R	2003	Omega2003，31，4：	1
11	The CONWIP production control system: Review and research issues显示文摘	Framinan J M Gonzalez PL Ruiz-Usano R	2003	Production Planning & Control2003，14，3：	1
12	An efficient constructive heuristic for flowtime minimisation in permutation flow shops显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1
13	Dynamic card controlling in a CONWIP system 显示文摘	Framinan JM Gonzalez PL Ruiz--Usano R	2006	Int J Production Economics2006，，99：	1
14	An efficient heuristic for total flowtime mininlization in no-wait tlowshops显示文摘	Framinan J M Nageno M S Moccellin J V	2010	International Jour- nal of Advanced Manufacturing Technology2010，46，：	1
15	An enhanced timetabling procedure for the no-wait job shop problem:A complete local search approach显示文摘	Framinan J M Schuster C	2006	Computers & Operations Research2006，331，：	1
16	Input control and dispatching rules in a dynamic conwip flow-shop显示文摘	Framinan J	2000	International Journal of production research2000，38，18：	1
17	An efficient constructive heuristic for flowtime minimization in permutation flow shops显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1
18	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
19	Application of Business Process Management to drive the deployment of a speech recognition system in a healthcare organization显示文摘	Gondez Sanchez MJ Framinan Tones JM Para Calderon CL		0，，：	1
20	An efficient constructive heuristic for flowtime minimisation in permutation flow shops显示文摘	Framinan J M Leisten R	2003	Omega2003，31，4：	1

返回顶部每页显示：

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

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

用户提示