A combinatorial particle swarm optimisation for solving permutation flowshop problems
Author:
Publisher
Elsevier BV
Subject
General Engineering,General Computer Science
Reference40 articles.
1. Minimizing the sum of completion times of n jobs over m machines in a flowshop: a branch and bound approach;Bansal;AIIE Transactions,1977
2. A tabu search approach for the flow shop scheduling problem;Ben-Daya;European Journal of Operational Research,1998
3. Some applications of the branch and bound algorithm to the machine scheduling problem;Brown;Operational Research Quarterly,1966
4. A heuristic algorithm for the n job, m machine sequencing problem;Campbell;Management Science,1970
5. A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems;Chung;International Journal of Production Economics,2002
Cited by 73 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Random Forest-Assisted Local Search for Expensive Permutation-based Combinatorial Optimization Problems;2024 IEEE Congress on Evolutionary Computation (CEC);2024-06-30
2. Addressing the Single and Multi-Objective Energy-Aware Flowshop Scheduling Problem Through Diverse Variations of the Pso Algorithm;2024
3. A Hybrid Discrete Memetic Algorithm for Solving Flow-Shop Scheduling Problems;Algorithms;2023-08-26
4. Cellular particle swarm optimization with a simple adaptive local search strategy for the permutation flow shop scheduling problem;Archives of Control Sciences;2023-07-26
5. Hybridization of Particle Swarm Optimization with Variable Neighborhood Search and Simulated Annealing for Improved Handling of the Permutation Flow-Shop Scheduling Problem;Systems;2023-04-26
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3