Trade-off balancing between maximum and total completion times for no-wait flow shop production-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Trade-off balancing between maximum and total completion times for no-wait flow shop production

Published:2019-06-20 Issue:11 Volume:58 Page:3235-3251
ISSN:0020-7543
Container-title:International Journal of Production Research
language:en
Short-container-title:International Journal of Production Research

Author:

Ye Honghan¹,Li Wei²^ORCID,Nault Barrie R.³

Affiliation:

1. Department of Industrial & Systems Engineering, University of Wisconsin-Madison, Madison, WI, USA

2. Department of Mechanical Engineering, University of Kentucky, Lexington, KY, USA

3. Haskayne School of Business, University of Calgary, Calgary, AB, Canada

Funder

Agency for Healthcare Research and Quality

Publisher

Informa UK Limited

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research,Strategy and Management

Link

https://www.tandfonline.com/doi/pdf/10.1080/00207543.2019.1630777

Reference52 articles.

1. New heuristics for m-machine no-wait flowshop to minimize total completion time

2. A survey of scheduling problems with no-wait in process

3. No-wait flowshops with bicriteria of makespan and total completion time

4. Algorithms for no-wait flowshops with total completion time subject to makespan

5. Total completion time with makespan constraint in no-wait flowshops with setup times

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops;Swarm and Evolutionary Computation;2024-08

2. A hybrid scatter search method for solving fuzzy no-wait flow-shop scheduling problems;Engineering Optimization;2024-07-04

3. An ALNS to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times;TOP;2024-03-29

4. An effective approach for total completion time minimization subject to makespan constraint in permutation flowshops;Engineering Optimization;2024-02-07

5. 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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3