Some results on an assignment problem variant

Pritibhushan Sinha ()

OPSEARCH, 2021, vol. 58, issue 1, No 8, 144-147

Abstract: 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.

Keywords: Assignment problem variant; Negative changeover costs; Complexity result; NP-hard (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-020-00472-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:58:y:2021:i:1:d:10.1007_s12597-020-00472-7

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-020-00472-7

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().