Population-based dynamic scheduling optimisation for complex production process Online publication date: Fri, 01-Jun-2012
by Jing An; Qi Kang; Lei Wang; Qidi Wu
International Journal of Computer Applications in Technology (IJCAT), Vol. 43, No. 4, 2012
Abstract: This paper presents a population-based approximate scheduling approach for complex production process, by using heuristic stochastic optimisation strategies. In this approach, particle swarm optimisation (PSO) is adopted to find a near optimal operation sequence and schedule strategy based on the criterion of minimal total make-span (TMS) in its admissible sequence space. Discrete dynamic programming method is integrated for the usage of fitness evaluation. A minifab model is studied to illustrate the proposed population-based scheduling algorithm (PSA), which can approach the optimal results by computing partial solution sequences.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com