维普中文期刊产品整合服务
17篇 您的检索式:作者名="Sourd"
    题名 作者 年代 出处 被引量
1Earliness-tardiness scheduling with setup considerations显示文摘SOURD F 2005Computers & Operations Research2005,32,7:1
2The complexity of mean flow time scheduling problems with release times显示文摘Philippe Baptiste Peter Brucker Marek Chrobak Christoph Dürr Svetlana A. Kravchenko Francis Sourd 2007Journal of Scheduling2007,,2:1
3Leaching mechanisms in immersion lithography with or without top coat 显示文摘Gaugiran S Feilleux R Sourd C 2007Microelectronic Engineering2007,84,:1
4Earliness-tardiness scheduling with setup considerations显示文摘Sourd F 2005Computers & Operations Research2005,32,:1
5Lagrangian bounds for just-in-time job-shop seheduIing显示文摘BAPTISTE P FLAMINI M SOURD F 2008Computers Opera- tions Research2008,35,3:1
6Lagrangian bounds for just-in- time job-shop scheduling 显示文摘Baptiste P Flamini M Sourd F 2008Computers and Operations Re- search2008,35,:1
7Lagrangian Bounds for Just--in-time Job-- shop Seheduling显示文摘Baptiste P Flamini M Sourd F 2008Computers & Operations Research2008,35,:1
8Lagrangian boun- ds for just-in-time Job-Shop scheduling显示文摘BAPTISTEA P FLAMINI M SOURD F 2008Computers& Operations Research2008,35,3:1
9Lagrangian bounds for just- in-time job-shop scheduling 显示文摘Baptiste P Flamini M Sourd F 2008Computers & Operations Research2008,35,:1
10Lower boundsfor the earliness-tardiness scheduling problem on parallelmachines with distinct due dates显示文摘Kedad-Sidhoum S Solis Y R Sourd F 2008European J ofOperational Research2008,189,3:1
11Earliness/tardiness scheduling with setup considerations 显示文摘Sourd F 2005Computers & Operations Research2005,32,7:1
12Lagrangian bounds for just-in-time job-shop scheduling显示文摘Philippe Baptiste Marta Flamini Francis Sourd 2006Computers and Operations Research2006,,3:1
13Lagrangian bounds for just-intime jobshop scheduling显示文摘Philippe B Flamini M Sourd F 0,,:1
14Search tree based approaches for parallel machine scheduling显示文摘Neron E Tercinet F Sourd F 2008Computers & Operations Research2008,35,4:1
15Search tree based approaches for parallel machine scheduling 显示文摘Neron E Tercinet F Sourd F 2008Computers & Operations Research2008,35,4:1
16Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates 显示文摘KEDAD-SIDHOUM S SOLIS Y R SOURD F 2008European Journal of Operations Research2008,189,3:1
17Lower bounds for the earliness-tardinessscheduling problem on parallel machines with distinct due dates显示文摘Sidhoum S K Solis Y R Sourd F 2008European Journal of Operational Research2008,189,:1
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

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