Seru scheduling problems with learning effect and job deterioration during an increasing adjustment period

This paper focuses on seru scheduling problems during an increasing adjustment period considering learning effects and job deteriorations, in which the job's processing time is defined by a function of job position in the processing sequence, adjustment position and effects of learning and deterioration. Each seru has an increasing adjustment period, which means that the later the adjustment, the longer the duration. Moreover, the seru will return to its original state and the deterioration effect will restart from new position after adjustment, yet the learning effect keeps growing. The objectives are to minimise the total seru loads (TSL), the total completion times (TC) and the total absolute deviation in completion times (TADC), respectively. A general exact solution method is proposed and optimal solutions for seru scheduling problems are obtained. The comprehensive experimental analysis is conducted, and the results demonstrate that the proposed method is able to return high-quality solutions for seru scheduling problems.