给定一个带期限的作业排序问题, n=5, (p1,p2,p3,p4,p5)=(6,3,4,8,5), (t1,t2,t3,t4,t5)=(2,1,2,1,1), (d1,d2,d3,d4,d5)= (3,1,4,2,4), 应用FIFOBB求使总罚款数最小的可行作业集J, 要求:实现对不同作业排序问题实例的求解，问题实例的输入数据存储在case.txt文件中。-Given a scheduling problem with the operation period, n = 5, (p1, p2, p3, p4, p5) = (6,3,4,8,5), (t1, t2, t3, t4, t5) = (2,1,2,1,1), (d1, d2, d3, d4, d5) = (3,1,4,2,4), seeking to make a total fine of application FIFOBB the smallest possible number of job set J, requirements: to achieve the scheduling problem instances of different operating solving the problem instance of the input data is stored in the case.txt file。