Efficient Heuristics for Scheduling with Release and Delivery Times
Author:
Publisher
InTech
Link
http://www.intechopen.com/download/pdf/55810
Reference41 articles.
1. Adams J, Balas E, Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science. 1988;34:391–401
2. Bratley P, Florian M, Robillard P. On sequencing with earliest start times and due‐dates with application to computing bounds for (n/m/G/Fmax) problem. Naval Research Logistics Quarterly. 1973;20:57–67
3. Brinkkotter W, Brucker P. Solving open benchmark instances for the job‐shop problem by parallel head–tail adjustments. Journal of Scheduling. 2001;4:53–64
4. Carballo L, Vakhania N, Werner F. Reducing efficiently the search tree for multiprocessor job‐shop scheduling problems. International Journal of Production Research 2013;51(23–24):7105–7119. DOI: 10.1080/00207543.2013.837226
5. Carlier J. The one‐machine sequencing problem. European Journal of Operations Research. 1982;11:42–47
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3