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 giarantee 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 a feasible starting time of all the activities based on sequence constraints, the heuristic algorithm is used to obtain a feasible solution of the scheduling problem based on resource constraints. The feasible scheduling solution is obtained by a gradient optimization function. Simulations have shown that the proposed combined approach is efficient and feasible with respect to concurrent activities scheduling.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Hatch M, Badienelli R D. A concurrent optimization methodology for concurrent engineering.IEEE Trans. Eng. Manage., 1999, 46(1): 72–86.
Tappeta V R, Renau E J. A comparison of equality constraints formulation for concurrent design optimization.Concurrent Eng. Res. Appl., 1997, 5: 253–261.
Badiru A B. Scheduling of concurrent manufacturing projects.Concurrent Engineering: Contemporary Issues and Modern Design Tools, Cambridge University Press, 1993, pp.93–109.
Yan J H, Wu C. A scheduling approach for design activities in concurrent engineering.IEEE Trans. SMC, part C, 2001, 31(3): 361–365.
Foo S Y, Takefuji Y, Szu H. Job-shop scheduling based on modified Tank-Hopfield linear programming networks.Eng. Appl. Artificial Intelligent, 1994, 7: 321–327.
Willems T M, Brandts L E M W. Implementing heuristics as an optimization criterion in neural networks for job-shop scheduling.J. Intell. Manufacturing, 1995, 6: 377–387.
Willems T M. Neural networks for job-shop scheduling.Contr. Eng. Practice, 1994, 2: 31–39.
Yu H B. Research of intelligent production scheduling methods and their applications [Dissertation]. Northeastern University of China, 1997.
Yu H B, Xue J Set al. A production scheduling approach based on neural network.ACTA AUTOMATICA SINGA, 1999, 25: 449–456.
Yang S X, Wang D W. Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.IEEE Trans. Neural Networks, 2000, 11: 474–486.
Xiong G L, Zhang Y Y, Li B H. The research on collective techniques and executive methods for concurrent engineering.Computer Integrated Manufacturing Systems, 1996, 3: 3–8.
Yan J H. Research on optimal scheduling for concurrent activities. Postdoctoral Research Report, Tsinghua University, August, 2001.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yan, J., Wu, C. A constraint satisfaction neural network and heuristic combined approach for concurrent activities scheduling. J. Comput. Sci. & Technol. 18, 252–257 (2003). https://doi.org/10.1007/BF02948893
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02948893