A Two-Agent Single-Machine Scheduling Problem with Learning and Deteriorating Considerations

Abstract EN

Recently, interest in scheduling with deteriorating jobs and learning effects has kept growing.

However, research in this area has seldom considered the multiagent setting.

Motivated by these observations, we consider two-agent scheduling on a single machine involving the learning effects and deteriorating jobs simultaneously.

In the proposed model, we assume that the actual processing time of a job of the first (second) agent is a decreasing (increasing) function of the total processing time of the jobs already processed in a schedule.

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 a simulated annealing algorithms for the problem.

We perform extensive computational experiments to test the performance of the algorithms.