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

49篇 您的检索式：作者名="Hurink"

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

	题名	作者	年代	出处	被引量
1	Flow- shop problems with intermediate buffers显示文摘	BRUCKER P HEITMANN S HURINK J	2003	OR Spectrum2003，25，4：	1
2	List scheduling in a parallel machine environment with precedence constraints and setup times显示文摘	HURINK J KNUST S	2001	Operations Research Letters2001，29，5：	1
3	Tabu search algorithms for job-shopproblems with a single transport robot 显示文摘	Hurink J Knust S	2005	European Journalof Operational Research2005，162，1：	1
4	Flow-Shop Problems with Intermediate Buffers显示文摘	Brucker P Heitmann S Hurink J	2003	OR Spectrum2003，25，4：	1
5	Adjacent-resource Scheduling: Why Spatial Resources are so Hard to Incorporate显示文摘	Jacob Jan Paulus Johann Hurink	2006	Electronic Notes in Discrete Mathe- matics2006，25，：	1
6	A tabu search algorithm for scheduling a single robot in a job-shop environment显示文摘	Hurink J Knust S	2002	Discrete Applied Mathematics2002，119，12：	1
7	List scheduling in a parallel machine environment with precedence constraints and setup times显示文摘	HURINK J KNUST S	2001	Operations Research Letters2001，29，5：	1
8	Tabu search algorithms for job-shop problems with a single transport robot 显示文摘	Hurink J Knust S	2005	European Journal of Operational Research2005，162，1：	1
9	Scheduling identical jobs with chain precedence constraints on two uniform machines显示文摘	Johann Hurink Wieslaw Kubiak	1999	Math Meth Oper Res1999，49，：	1
10	An Exponential Neighbourhood for a Onemachine Batching Problem显示文摘	Hurink J	1999	OR Spektrum1999，21，4：	1
11	Tabu search for the Job-Shop scheduling problem with multi-purpose machine 显示文摘	HURINK E JURISCH B THOLE M	1994	Operations Research Spektrum1994，15，5：	1
12	Tabu search for the job-shop scheduling problem with multi-purpose ma- chines显示文摘	Johann Hurink Bernd Jurisch Monika Thole	1994	OR Spektrum1994，，15：	1
13	Adjacent-resource scheduling why spatial resources are so hard to incorporate显示文摘	PAULUS J J HURINK J	2006	Electronic Notes in Discrete Mathematics2006，25，：	1
14	Flow-shop problems with intermediate buffers 显示文摘	BRUCKER P HEITMANN S HURINK J	2003	OR Spectrum2003，25，4：	1
15	Flow-shop problems with intermediate buffers显示文摘	Brucker P Heitmann S Hurink J	2003	OR Spectrum2003，25，：	1
16	Makespan minimization for flow-shop prob- lems with transportation times and a single robot 显示文摘	Hurink J Knust S	2001	Discrete Applied Mathematics2001，112，1：	1
17	A branch & bound algorithm for the open-shop problem显示文摘	BRUCKER P HURINK J JURISCH B	1997	Discrete Applied Mathematics1997，76，123：	1
18	A polynomial algorithm for P \| pj=1, rj, outtree \| ∑ Cj显示文摘	Peter Brucker Johann Hurink Sigrid Knust	2003	Mathematical Methods of Operations Research2003，，3：	1
19	Tabu search for the job shop scheduling problem with multi-purpose machine显示文摘	Hurink E Jurisch B Thole M	1994	Operations Research Spektrum1994，15，：	1
20	Scheduling identical jobs with chain precedence constraints on uniform machines显示文摘	Brucker P Hurink J Kubiak W	1999	Mathematical Methods of Operations Research1999，49，：	1

返回顶部每页显示：

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

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

用户提示