A Genetic Algorithm-Based Approach for Single-Machine Scheduling with Learning Effect and Release Time

<table>The performance of the genetic algorithms for various <svg height="7.9499998" id="M255" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 8.7250004 7.9499998" width="8.7250004" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M483 97q-42 -50 -88.5 -79.5t-68.5 -29.5q-37 0 -17 93l22 102h-2q-54 -79 -144 -149q-59 -46 -100 -46q-24 0 -43 29t-19 86q0 78 34.5 153t94.5 120q41 31 94 51.5t98 20.5q29 0 72 -9q26 -6 39 -6l2 -4q-30 -117 -67 -323q-8 -41 2 -41q16 0 79 58zM374 387
q-32 15 -73 15q-52 0 -83 -23q-48 -36 -78 -108.5t-30 -152.5q0 -33 8.5 -50.5t20.5 -17.5q31 0 107 79t99 132q15 40 29 126z" id="x1D44E"></path></g>
</svg>.</table>

Mathematical Problems in Engineering

fig9

Figure 9

Figure 9: A Genetic Algorithm-Based Approach for Single-Machine Scheduling with Learning Effect and Release Time 