A good balance for an online scheduling problem considering both learning and deteriorating effects in the handicraft process
研究手工艺过程中同时考虑学习与恶化效应的在线调度问题，提出最优算法DSBPT，其竞争比为2，并通过仿真验证了算法有效性和管理启示。
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 Jj is pjr=pjrb+at, where pj is the initial processing time of Jj, t is the starting time of Jj, r is the seating arrangement position of Jj, 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 decision-makers to production optimization.