Journal of Applied Sciences ›› 2001, Vol. 19 ›› Issue (3): 241-244.
• Articles • Previous Articles Next Articles
YAN Ji-hong, WU Cheng
Received:
Revised:
Online:
Published:
Abstract: Scheduling activities in concurrent product development process is of great significance to shorten development lead time and minimize the cost; moreover, it can eliminate the unnecessary redesign periods and guarantee that serial activities can be executed as concurrently as possible. This paper presents a constraint satisfaction neural network and heuristic combined approach for concurrent activities scheduling. In the combined approach, the neural network is used to obtain feasible starting time of all the activities based on sequence constraints, the heuristic algorithm is used to obtain feasible solution of the scheduling problem based on resource constraints. The feasible scheduling solution is obtained by a gradient optimization function. Applications have shown that the proposed combined approach is efficient and feasible with respect to concurrent activities scheduling.
Key words: concurrent engineering, product development process, heuristic, constraints satisfaction neural network, scheduling problem
CLC Number:
TP273
YAN Ji-hong, WU Cheng. A Neural Network Based Approach for Concurrent Activities Scheduling[J]. Journal of Applied Sciences, 2001, 19(3): 241-244.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jas.shu.edu.cn/EN/
https://www.jas.shu.edu.cn/EN/Y2001/V19/I3/241