A huge number of different product types are managed through various processes in facilities with different approaches to scheduling. In this paper, we concentrate mainly on process-focused facilities. Sample groups of such facilities and processes were selected: its orders and times were investigated using both biological computation and genetic algorithms. First, biological computation was used to determine practical schedules. Second, genetic algorithms were used to identify which of the schedules determined by biological computation worked best. Here, we examine how combining these methods can be applied to solving process-focused scheduling problems. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Kim, I., & Watada, J. (2009). A hybrid method of biological computation and genetic algorithms for resolving process-focused scheduling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5712 LNAI, pp. 159–165). https://doi.org/10.1007/978-3-642-04592-9_20
Mendeley helps you to discover research relevant for your work.