International Journal of Computational Intelligence Systems

<Previous Article In Issue
Next Article In Issue>
Volume 11, Issue 1, 2018, Pages 1210 - 1228

A Robust Predictive–Reactive Allocating Approach, Considering Random Design Change in Complex Product Design Processes

Authors
Jiafu Su1, jiafu.su@hotmail.com, Meng Wei2, 3, weimeng_cqu@163.com, Aijun Liu*4, ajliu@xidian.edu.cn
1Chongqing Key Laboratory of Electronic Commerce & Supply Chain System, Chongqing Technology and Business University, No. 19, Xuefu Avenue, Nan’an District, Chongqing, 400067, China
2College of Mechanical Engineering, Chongqing University, No.174 Shazhengjie, shangpingba District, Chongqing, 400030, China
3Chongqing Bashu IVY School, No.51, North District Road, Yuzhong District, Chongqing, 400013, China
4School of Economics & Management, Xidian University, 266 Xinglong Section of Xifeng Road, Xi’an, Shaanxi 71012, China
Corresponding Author
Received 10 October 2017, Accepted 27 June 2018, Available Online 12 July 2018.
DOI
10.2991/ijcis.11.1.91How to use a DOI?
Keywords
robust predictive–reactive allocating; design change; compressing execution time; match-up time
Abstract

In the highly dynamic complex product design process, task allocations recovered by reactive allocating decisions are usually subject to design changes. In this paper, a robust predictive–reactive allocating approach considering possible disruption times is proposed, so that it can absorb the disruption in the executing process and utilize the limited capacity of resource more effectively. Four indexes (Makespan, stability, robustness, and compression cost) are used to measure the quality of the proposed method. To illustrate the novel allocating idea, we first assign tasks to resources with the objective of a trade-off between the overall execution time and the overall design cost, which can transform the problem into a non-identical parallel environment. Then, the probability distribution sequencing (PDS) method combining with inserting idle time (IIT) is proposed to generate an original-predictive allocation. A match-up time strategy is considered to match up with the initial allocation at some point in the future. The relationship between the minimum match-up time and the compression cost is analyzed to find the optimal match-up time. Our computational results show that the proposed sequencing method is better than the shortest processing time (SPT) which is a common sequencing way mentioned in the literature. The robust predictive–reactive allocating approach is sensitive to the design change, which is helpful to reduce the reallocating cost and keep the robustness and stability.

Copyright
© 2018, the Authors. Published by Atlantis Press.
Open Access
This is an open access article under the CC BY-NC license (http://creativecommons.org/licences/by-nc/4.0/).

Download article (PDF)
View full text (HTML)

<Previous Article In Issue
Next Article In Issue>
Journal
International Journal of Computational Intelligence Systems
Volume-Issue
11 - 1
Pages
1210 - 1228
Publication Date
2018/07/12
ISSN (Online)
1875-6883
ISSN (Print)
1875-6891
DOI
10.2991/ijcis.11.1.91How to use a DOI?
Copyright
© 2018, the Authors. Published by Atlantis Press.
Open Access
This is an open access article under the CC BY-NC license (http://creativecommons.org/licences/by-nc/4.0/).

Cite this article

risenwbib
TY  - JOUR
AU  - Jiafu Su
AU  - Meng Wei
AU  - Aijun Liu*
PY  - 2018
DA  - 2018/07/12
TI  - A Robust Predictive–Reactive Allocating Approach, Considering Random Design Change in Complex Product Design Processes
JO  - International Journal of Computational Intelligence Systems
SP  - 1210
EP  - 1228
VL  - 11
IS  - 1
SN  - 1875-6883
UR  - https://doi.org/10.2991/ijcis.11.1.91
DO  - 10.2991/ijcis.11.1.91
ID  - Su2018
ER  -