Time-cost trade-off analysis of a priority based assignment problem

Prabhjot Kaur (), Kalpana Dahiya () and Vanita Verma ()
Additional contact information
Prabhjot Kaur: UIET, Panjab University
Kalpana Dahiya: UIET, Panjab University
Vanita Verma: Panjab University

OPSEARCH, 2021, vol. 58, issue 2, No 8, 448-482

Abstract: Abstract In this paper, a bi-objective priority based assignment problem (BPBAP) related to an industrial project, is considered in which, depending upon the work breakdown structure, the n tasks involved in the project are divided into two categories. One of the categories consists of m primary tasks and the other one consists of $$(n-m)$$ ( n - m ) secondary tasks (for $$m

Keywords: Optimization; Non-linear programming; Assignment problem; Bi-objective; Efficient solutions; 90C26; 90C27 (search for similar items in EconPapers)
JEL-codes: C61 C63 (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-00483-4 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:2:d:10.1007_s12597-020-00483-4

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

DOI: 10.1007/s12597-020-00483-4

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 ().