Three parallel task assignment problems with shared resources

Ali Diabat, Alexandre Dolgui, Władysław Janiak, Mikhail Y. Kovalyov

Research output: Contribution to journalArticlepeer-review


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 whether resource sharing between the tasks is limited. We present very efficient solution procedures for two of these problems and prove that the third problem is NP-hard in the strong sense and that it can be solved efficiently for special cases. Applications include optimal resource allocation problems in labor-intensive cellular manufacturing and in parallel task computing.

Original languageEnglish (US)
Pages (from-to)478-485
Number of pages8
JournalIISE Transactions
Issue number4
StatePublished - Apr 2 2020


  • Resource allocation
  • cellular manufacturing
  • computational complexity
  • parallel task computing
  • polynomial algorithms

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Three parallel task assignment problems with shared resources'. Together they form a unique fingerprint.

Cite this