Articles with "assignment problems" as a keyword



Photo from wikipedia

Three parallel task assignment problems with shared resources

Sign Up to like & get
recommendations!
Published in 2020 at "IISE Transactions"

DOI: 10.1080/24725854.2019.1680907

Abstract: Abstract We study three optimization problems in which non-renewable resources are used to execute tasks in parallel. Problems differentiate by the assumptions of whether a resource can be shared between several tasks or not, or… read more here.

Keywords: three parallel; shared resources; problems shared; parallel task ... See more keywords
Photo from wikipedia

Partially Fixed Structure Determinantal Assignment Problems

Sign Up to like & get
recommendations!
Published in 2021 at "IEEE Transactions on Automatic Control"

DOI: 10.1109/tac.2020.3010767

Abstract: In this article, we deal with the study of the determinantal assignment problem (DAP) when the parameters of the compensator are not entirely free, but some of them are fixed. The problem is reduced to… read more here.

Keywords: assignment problems; problem; partial decomposability; assignment ... See more keywords
Photo by karthik1324 from unsplash

Group Role Assignment With Constraints (GRA+): A New Category of Assignment Problems

Sign Up to like & get
recommendations!
Published in 2023 at "IEEE Transactions on Systems, Man, and Cybernetics: Systems"

DOI: 10.1109/tsmc.2022.3199096

Abstract: This article systematically establishes a new category of assignment problems by reviewing and extending the problems related to group role assignment (GRA) from a novel vision. After reviewing seven related GRA with Constraints (GRA+) problems,… read more here.

Keywords: article; role; category assignment; new category ... See more keywords
Photo from wikipedia

Genetic algorithm for quadratic assignment problems: application of Taguchi method for optimisation

Sign Up to like & get
recommendations!
Published in 2020 at "International Journal of Operational Research"

DOI: 10.1504/ijor.2020.10027998

Abstract: Quadratic assignment problems (QAPs) are the hardest of combinatorial optimisation problems, with some problems of sizes of the order of 30 still remaining unsolved optimally. Solving QAPs with exact optimisation methods is cumbersome and hence,… read more here.

Keywords: genetic algorithm; optimisation; quadratic assignment; assignment problems ... See more keywords