Some results on an assignment problem variant

Abstract

We consider a model of an assignment problem, in which an operator can do one job, multiple jobs, or no job at all. There is a job changeover cost, for any extra assignment in excess of one. The changeover costs depend only on the operator, but can be negative. We give a nonlinear integer programming formulation of the problem. We show that, the problem is NP-hard.