A simple, fast and effective heuristic for the Simple Assembly Line Balancing Type I problem (minimizing the number of workstations) is proposed. A fast and effective branch-and-bound algorithm, which ...

In classical computing, codon optimization is addressed with genetic algorithms (GAs) that sample and iterate many different combinations of codons before settling on the most "optimal" solution.