No-wait or no-idle permutation flowshop scheduling with dominating machines
Author:
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Link
http://link.springer.com/content/pdf/10.1007/BF02936066.pdf
Reference14 articles.
1. I. Adiri and D. Pohoryles,Flowshop/on-idle or no-wait scheduling to minimize the sum of completion times, Naval Research Logistics Quarterly29 (1982), 495–504.
2. K. R. Baker,Introduction to sequencing and scheduling, Wiley, New York, 1974.
3. O. Čepek, M. Okada and M. Vlach,Nonpreemptive flowshop scheduling with machine dominance, European Journal of Operational Research139 (2002), 245–261.
4. M. R. Garey, D. S. Johnson and R. Sethi,The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research1 (1976), 117–129.
5. R. L. Graham, E. L. Lawler, J. K. Lenstra and A.H.G. Rinnooy Kan,Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics5 (1979), 287–326.
Cited by 20 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem;Computers & Operations Research;2022-10
2. A survey of scheduling problems with no-wait in process;European Journal of Operational Research;2016-12
3. Solution algorithms for synchronous flow shop problems with two dominating machines;Computers & Operations Research;2016-10
4. Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs;Applied Mathematical Modelling;2016-02
5. Review and classification of constructive heuristics mechanisms for no-wait flow shop problem;The International Journal of Advanced Manufacturing Technology;2016-01-18
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3