Minimising makespan in distributed mixed no-idle flowshops

Cheng Chen-Yang; Ying Kuo-Ching; Chen Hsia-Hsiang; Lu Hsiao-Shan

首页> 外文期刊>International Journal of Production Research >Minimising makespan in distributed mixed no-idle flowshops

【24h】

Minimising makespan in distributed mixed no-idle flowshops

机译：在分布式混合无怠速流水车间中最小化制造时间

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed scheduling problems. This work studied the distributed mixed no-idle flowshop scheduling problem using makespan as an optimality criterion. To the best of the authors' knowledge, this is the first paper to study the multi-flowshop extension in which each flowshop has mixed no-idle constraints. A novel cloud theory-based iterated greedy (CTBIG) algorithm was proposed for solving the problem. Computational experiments conducted on a set of test instances revealed that the proposed CTBIG algorithm significantly outperformed classic iterated greedy algorithms.

机译：当今工业中分布式制造的快速发展最近引起了对分布式调度问题的大量研究关注。这项工作使用makespan作为最佳准则研究了分布式混合的无空闲flowshop调度问题。据作者所知，这是第一篇研究多流程商店扩展的论文，其中每个流程商店都混合了无空闲约束。提出了一种新的基于云理论的迭代贪婪算法（CTBIG）。在一组测试实例上进行的计算实验表明，提出的CTBIG算法明显优于经典的迭代贪婪算法。

著录项

来源
《International Journal of Production Research》 |2019年第2期|48-60|共13页
作者
Cheng Chen-Yang; Ying Kuo-Ching; Chen Hsia-Hsiang; Lu Hsiao-Shan;
展开▼
作者单位

Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei, Taiwan;

Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei, Taiwan;

Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei, Taiwan;

Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei, Taiwan|Nanya Technol Corp, New Taipei, Taiwan;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类
关键词
scheduling; makespan; metaheuristics; distributed mixed no-idle flowshop; cloud theory-based iterated greedy algorithm;

机译：调度;makespan;计量学;分布式混合无空闲Flowshop;基于云理论的迭代贪婪算法;

相似文献

外文文献
中文文献
专利

1. Minimising makespan in distributed mixed no-idle flowshops [J] . Cheng Chen-Yang, Ying Kuo-Ching, Chen Hsia-Hsiang, International Journal of Production Research . 2019,第1a2期

机译：最小化分布式混合无空闲流量的MakEspan
2. Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation [J] . Swarm and Evolutionary Computation . 2020,第期

机译：具有序列依赖性设置时间的混合No-Idle流程的启发式和血管训练和总迟到最小化
3. Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan [J] . Zhang Guanghui, Xing Keyi, Cao Feng International Journal of Production Research . 2018,第9a10期

机译：通过灵活的组装和设置时间来调度分布式流水车间，以最大程度地缩短制造时间
4. A Two-Stage Memetic Algorithm for Distributed No-Idle Permutation Flowshop Scheduling Problem [C] . Chen Ling-Fang, Wang Ling, Wang Jing-jing Chinese Control Conference . 2018

机译：分布式无空闲排列Flowshop调度问题的两阶段Memetic算法
5. Minimizing makespan for hybrid flowshops with batch, discrete processing machines and arbitrary job sizes. [D] . Zheng, Yanming. 2011

机译：使用批处理，离散处理机器和任意作业大小的混合流水车间，最小化制造时间。
6. Minimising the Kullback–Leibler Divergence for Model Selection in Distributed Nonlinear Systems [O] . Oliver M. Cliff, Mikhail Prokopenko, Robert Fitch 2018

机译：最小化分布式非线性系统中模型选择的kullback-leibler发散
7. Flowshop/no-idle scheduling to minimise the mean flowtime [O] . Laxmi Narain, P. C. Bagga 2005

机译：Flowshop / No-Idle Scheduling以最小化平均流量时间

Minimising makespan in distributed mixed no-idle flowshops

摘要

著录项

相似文献

相关主题

期刊订阅