A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
Author:
Publisher
Elsevier BV
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference26 articles.
1. Optimization and approximation in deterministic sequencing and scheduling: a survey;Graham;Annals of Discrete Mathematics,1979
2. Deterministic job-shop scheduling, present and future: past;Jain;European Journal of Operations Research,1999
3. Complexity of machine scheduling problems;Lenstra;Annals of Discrete Mathematics,1977
4. A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops;Singer;IIE Transactions,1998
5. Priority rules for job shops with weighted tardiness costs;Vepsalainen;Management Science,1987
Cited by 40 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An iterated local search for customer order scheduling in additive manufacturing;International Journal of Production Research;2023-01-24
2. A matheuristic for flexible job shop scheduling problem with lot-streaming and machine reconfigurations;International Journal of Production Research;2022-11-02
3. An improved genetic algorithm for flexible job shop scheduling problem considering reconfigurable machine tools with limited auxiliary modules;Journal of Manufacturing Systems;2022-01
4. Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling;Computers & Operations Research;2020-07
5. Distributed-elite local search based on a genetic algorithm for bi-objective job-shop scheduling under time-of-use tariffs;Evolutionary Intelligence;2020-05-31
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3