中文说明：采用遗传算法，解决作业调度问题。一共三个作业，每个作业有不同的时间长度和紧急程度，超过时间会有惩罚措施。通过遗传算法计算出最好的作业安排，使得惩罚最小，获益最大。最终结果通过GUI用甘特图的方式展示出来。
English Description：
Genetic algorithm to solve job scheduling problem. A total of three jobs, each job has a different length of time and urgency, over time there will be penalties. By genetic algorithm to calculate the best job arrangements, making the minimum punishment, the greatest benefit. The end result displayed by the GUI way with a Gantt chart.