Competitive Two-Agent Scheduling with Learning Effect and Release Times on a Single Machine

الملخص EN

The learning effect has gained much attention in the scheduling research recently, where many researchers have focused their problems on only one optimization.

This study further addresses the scheduling problem in which two agents compete to perform their own jobs with release times on a common single machine with learning effect.

The aim is to minimize the total weighted completion time of the first agent, subject to an upper bound on the maximum lateness of the second agent.

We propose a branch-and-bound approach with several useful dominance properties and an effective lower bound for searching the optimal solution and three simulated-annealing algorithms for the near-optimal solutions.

The computational results show that the proposed algorithms perform effectively and efficiently.