A two-agent single-machine scheduling problem to minimize the total cost with release dates

This paper considers a two-agent scheduling problem with arbitrary release dates on a single machine. The cost of the first agent is the maximum weighted completion time of its jobs while the cost of the second agent is the total weighted completion time of its jobs. The goal is to schedule the jobs...

Ausführliche Beschreibung