Son Duy Dao

Dr. Son Duy Dao

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2017 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
SDSon Duy Dao
Son Duy Dao
KAKazem Abhary
Kazem Abhary
RMRomeo Marian
Romeo Marian

1 December 2017 in Expert Systems with Applications
Verified
Journal Article
Closed access
SDSon Duy Dao
Son Duy Dao
KAKazem Abhary
Kazem Abhary
RMRomeo Marian
Romeo Marian

1 February 2021 in International Journal of Approximate Reasoning
Verified
Journal Article
Closed access
BDBapi Dutta
Bapi Dutta
SDSon Duy Dao
Son Duy Dao
Luis MartinezLuis Martinez
Luis Martinez
MGMark Goh
Mark Goh

1 November 2014 in Expert Systems with Applications
Verified
Journal Article
Closed access
SDSon Duy Dao
Son Duy Dao
Kazem AbharyKazem Abhary
Kazem Abhary
RMRomeo Marian
Romeo Marian

28 March 2016 in Progress in Artificial Intelligence
Verified
Journal Article
Closed access
PDF file
SDSon Duy Dao
Son Duy Dao
Kazem AbharyKazem Abhary
Kazem Abhary
RMRomeo Marian
Romeo Marian

9 January 2017 in Journal of Industrial Engineering International
Verified
Journal Article
Open access
PDF file
SDSon Duy Dao
Son Duy Dao
Kazem AbharyKazem Abhary
Kazem Abhary
RMRomeo Marian
Romeo Marian
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial, NP-hard problem, for which no polynomial time algorithm is known to produce an optimal result on a random graph. In this paper, the further development of Genetic Algorithm (GA) for this integrated optimization is presented. Because of the dynamic nature of the problem, the size of its solution is variable. To deal with this variability and find an optimal solution to the problem, GA with new features in chromosome encoding, crossover, mutation, selection as well as algorithm structure is developed herein. With the proposed structure, the proposed GA is able to “learn” from its experience. Robustness of the proposed GA is demonstrated by a complex numerical example in which performance of the proposed GA is compared with those of three commercial optimization solvers.