A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem
Author:
Publisher
Elsevier BV
Subject
Artificial Intelligence,Computer Science Applications,General Engineering
Reference202 articles.
1. An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer;Agnetis;Naval Research Logistics,1998
2. Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop;Ahmadi;European Journal of Operational Research,1990
3. Minimizing job idleness in deadline constrained environments;Ahmadi;Operations Research,1992
4. The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm;Akkan;European Journal of Operational Research,2004
5. A new heuristic and dominance relations for no-wait flowshops with setups;Aldowaisan;Computers & Operations Research,2001
Cited by 34 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A novel Soft Actor–Critic framework with disjunctive graph embedding and autoencoder mechanism for Job Shop Scheduling Problems;Journal of Manufacturing Systems;2024-10
2. Optimal Settings of Cryptocurrency Trading Pairs;2024 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS);2024-07-15
3. An Intelligent Manufacturing Management System for Enhancing Production in Small-Scale Industries;Electronics;2024-07-04
4. Modeling the evolution of incident impact in urban road networks by leveraging the spatiotemporal propagation of shockwaves;Transportation Research Part C: Emerging Technologies;2024-07
5. A deep reinforcement learning approach for dynamic task scheduling of flight tests;The Journal of Supercomputing;2024-05-22
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3