IMPLEMENTATION OF A MULTITHREADED BRANCH AND BOUND ALGORITHM FOR PERMUTATION FLOWSHOP PROBLEMS

机译：求解渗流问题的多元分支界算法的实现。

获取原文

获取原文并翻译 | 示例

页面导航

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

摘要

The general m-machine permutation flowshop problemrnwith the total flow-time objective is known to be NP-hardrnfor m ≥ 2. The only practical method for finding optimalrnsolutions has been branch and-bound algorithms. Consideringrnthe lengthy process in the search for an optimalrnschedule, we focus on using multiple threads for solvingrnpermutation flowshop problems on shared-memory multicorernplatforms. Our approach is based on a Master/Workerrnmodel and depth-first/best-first hybrid strategies. The experimentalrnresults show that the proposed method exhibitsrnimproved performance compared with the existing depthfirstrnparallel algorithm.

机译：具有总流动时间目标的一般m机置换流水车间问题已知为m≥2的NP-hardrn。寻找最优解的唯一实用方法是分支定界算法。考虑到寻找最优时间表的漫长过程，我们集中于使用多线程来解决共享内存多核平台上的置换流程问题。我们的方法基于Master / Workerrn模型和深度优先/最佳优先混合策略。实验结果表明，与现有的深度优先并行算法相比，该方法具有更好的性能。

著录项

来源
《Proceedings of the IASTED international conferences on informatics 2010》|2010年|p.271-277|共7页
会议地点 Marina del Rey(US);Marina del Rey(US);Marina del Rey(US);Marina del Rey(US);Marina del Rey(US)
作者
Chia-Shin Chung; James Flynn; Janche Sang;
展开▼
作者单位

Dept. of Operations and Supply Chain Management Cleveland State University Cleveland, OH 44115 email: c.chung@csuohio.edu;

Dept. of Operations and Supply Chain Management Cleveland State University Cleveland, OH 44115 j.flynn@csuohio.edu;

Dept. of Computer and Info. Science Cleveland State University Cleveland, OH 44115 email: sang@cis.csuohio.edu;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类信息处理技术;计算技术、计算机技术;
关键词
parallel branch and bound; multithreaded programming; multicore system; permutation flowshop; flow time;

机译：并行分支定界；多线程编程；多核系统；置换流水车间；流动时间;

相似文献

外文文献
中文文献
专利

1. Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives [J] . N. Madhushini, Chandrasekharan Rajendran European Journal of Industrial Engineering . 2011,第4期

机译：在单个目标和多个目标的m机置换流水车间中进行调度的分支定界算法
2. A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags [J] . Imen Hamdi, Ammar Oulamara, Taicir Loukil International Journal of Operational Research . 2015,第4期

机译：一种分支定界算法，以最小的时间滞后最小化两机置换Flowshop调度问题中的总拖延时间
3. A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems [J] . Chung CS, Flynn J, Kirca O European Journal of Operational Research . 2006,第1期

机译：分支定界算法可最大程度减少m机置换Flowshop问题的总拖延
4. IMPLEMENTATION OF A MULTITHREADED BRANCH AND BOUND ALGORITHM FOR PERMUTATION FLOWSHOP PROBLEMS [C] . Chia-Shin Chung, James Flynn, Janche Sang IASTED International Conferences on Informatics . 2010

机译：实现多线程分支和绑定算法的排列流程问题
5. DCABB: A framework for the development of distributed branch and bound algorithms. [D] . Kudva, Gautham K. 1994

机译：DCABB：用于开发分布式分支定界算法的框架。
6. Improved branch and bound algorithm for detecting SNP-SNP interactions in breast cancer [O] . Li-Yeh Chuang, Hsueh-Wei Chang, Ming-Cheng Lin, 2013

机译：检测乳腺癌中SNP-SNP相互作用的改进的分支定界算法
7. Grid Branch-and-Bound for Permutation Flowshop [O] . Maciej Drozdowski, Paweł Marciniak, Grzegorz Pawlak, 2013

机译：用于置换Flowshop的网格分支和绑定

IMPLEMENTATION OF A MULTITHREADED BRANCH AND BOUND ALGORITHM FOR PERMUTATION FLOWSHOP PROBLEMS

摘要

著录项

相似文献

相关主题

期刊订阅