.png){kind=icon}
Return
Genetic algorithm approach for precedence-constrained sequencing problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-009-0296-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we propose a genetic algorithm (GA) approach based on a topological sort (TS)-based representation procedure for effectively solving precedence-constrained sequencing problems (PCSPs). The TS-based representation procedure used in the proposed GA approach can generate feasible sequences in PCSPs. By applying the proposed GA approach, the sequence determination problems with precedence constraints can be easily solved. Experimental results show that the proposed GA approach is a good alternative in locating optimal sequence for various types of PCSPs.
Keywords:
Genetic algorithm
Precedence-constrained sequencing problems
Mixed integer programming
Topological sort
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.4
Papers:
3.5K
Citations:
1.1W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave no more
no more