On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time
Author:
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Link
http://link.springer.com/content/pdf/10.1007/s10479-019-03490-x.pdf
Reference42 articles.
1. Abdel-Basset, M., Manogaran, G., El-Shahat, D., & Mirjalili, S. (2018). A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Generation Computer Systems, 85, 129–145.
2. Dong, X., Chen, P., Huang, H., & Nowak, M. (2013). A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time. Computers & Operations Research, 40(2), 627–632.
3. Dong, X., Huang, H., & Chen, P. (2009). An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Computers & Operations Research, 36(5), 1664–1669.
4. Fernandez-Viagas, V., Valente, J. M., & Framinan, J. M. (2018). Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness. Expert Systems with Applications, 94, 58–69.
5. Jiang, E., & Wang, L. (2019). An improved multi-objective evolutionary algorithm based on decomposition for energy-efficient permutation flow shop scheduling problem with sequence-dependent setup time. International Journal of Production Research, 57(6), 1756–1771.
Cited by 19 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Effective Population-Based Meta-heuristics with NEH and GRASP Heuristics Minimizing Total Weighted flow Time in No-Wait Flow Shop Scheduling Problem Under Sequence-Dependent Setup Time Constraint;Arabian Journal for Science and Engineering;2024-01-18
2. Minimizing the maximum tardiness for a permutation flow shop problem under the constraint of sequence independent setup time;RAIRO - Operations Research;2024-01
3. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time;Journal of Project Management;2024
4. A Quantitative Evaluation of Statistical Practices in Metaheuristics Research;2024
5. Multi-Objective Optimization Flow Shop Scheduling Problem Solving the Makespan and Total Flow Time with Sequence Independent Setup Time;Journal of Advanced Manufacturing Systems;2023-09-27
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3