A good balance for an online scheduling problem considering both learning and deteriorating effects in the handicraft process

The paper considers an online scheduling problem with the effects of both learning and deterioration to minimize the total completion time. More specifically, we assume that the actual processing length of job J(j) is p(jr) = p(j)r(b) thorn at, where p(j) is the initial processing time of J(j), t is the starting time of J(j), r is the seating arrangement position of J(j), b is the learning factor and a is the deterioration factor, respectively. For this problem, we show that the performance ratio of any deterministic online algorithm is not <2 and provide a best possible online algorithm DSBPT with a competitive ratio of 2. Furthermore, we also present a concise computational simulation study to verify the effectiveness and efficiency of the proposed algorithm DSBPT, as well as the management implications provided for decisionmakers to production optimization.