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

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)$$ secondary tasks (for $$m

Keywords:

• time cost
• Assignment problem
• Special case
• Iterative method
• Time complexity
• execution time
• Job shop scheduling
• Mathematical optimization
• Work breakdown structure
• Computer science

• Correction
• Source
• Cite
• Save
• Machine Reading By IdeaReader