Two‐agent scheduling with position‐based deteriorating jobs and learning effects

Scheduling with deteriorating jobs and learning effects has been widely studied. However, multi‐agent scheduling with simultaneous considerations of deteriorating jobs and learning effects has hardly been considered until now. In view of this, we consider a two‐agent single‐machine scheduling problem involving deteriorating jobs and learning effects simultaneously. In the proposed model, given a schedule, we assume that the actual processing time of a job of the first agent is a function of position‐based learning while the actual processing time of a job of the second agent is a function of position‐based deterioration. The objective is to minimize the total weighted completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We develop a branch‐and‐bound and several simulated annealing algorithms to solve the problem. Computational results show that the proposed algorithms are efficient in producing near‐optimal solutions.