Parallel Machine Scheduling Problems With Learning And Deterioration Effect Under Fuzzy Environment

For the parallel machine scheduling problem with both learning and deteriora-tion effect, the actual Processing time is p[j] = pjα(t)β(r)] we focus on discussing the objective function to minimize makespan and total completion time for such problems in both conditions. In the first condition, we give the algorithm LPS and algorithm SPTP for the two objective functions, and analyze error ratio and the time complexity of any algorithm. In the second condition, basing on the fuzzy chance constrained programming, the corresponding nonlinear mathematical model is presented. The algorithm LSA is given for minimizing makespan, and the algo-rithm PDCG is given for minimizing total completion time.