Assignment problems with changeover cost

What is it about?

Assignment Problem is an optimization model that has wide scope of application. The problem may be stated as, there are n jobs and n operators. All the operators can do any of the jobs, but at different costs. Assignment costs are known. We have to find a minimum cost assignment, in which every operator is given exactly one job. There can be some generalization of the standard model. We have considered a generalization, such that an operator may be given more than 1 job, or no job at all. But, if an operator is given more than 1 job, there are some job changeover costs, in addition to the assignment costs. We consider a few types of such changeover costs.

Featured Image

Why is it important?

We show that, with certain types of the changeover costs, the problem remains "easy" to solve. But, for some other types of changeover costs, the problem becomes difficult. We suggest some heuristic solution methods for some of the latter types.

Perspectives