As a special form of the linear programming model, the transportation model and its solution method have been introduced thus far. This section introduces the assignment model, a special case of the transportation model. The term “Assignment” refers to the case of job allocations to a group of workers. In general, a worker has a single job and a job is done by a single worker. Similarly, the assignment model has the origin locations from where a single unit can be transported to a dedicated destination, and vice versa—the model has the destinations to which a single unit is sent solely from one origin location. Simply put, the number of the origins (represented by the workers) and the destinations (represented by the jobs) are equal, and the amount to be sent and received is strictly 1.

(see the relevant section in your book for more details.)