Three parallel task assignment problems with shared resources

Abstract : We study three manpower allocation problems in labor-intensive cellular manufacturing, for which mathematical programming formulations were already developed and computer tested but no computational complexity analysis is provided in the literature. We present very efficient new 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. Solutions of the studied problems can be used for solving more general manpower allocation and cell loading problems in labor-intensive cellular manufacturing.
Document type :
Journal articles
Complete list of metadatas

Cited literature [59 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02437934
Contributor : Alexandre Dolgui <>
Submitted on : Tuesday, January 14, 2020 - 8:47:59 AM
Last modification on : Friday, January 17, 2020 - 4:41:00 PM

File

Cell 11 May.pdf
Files produced by the author(s)

Identifiers

Citation

Ali Diabat, Alexandre Dolgui, Władysław Janiak, Mikhail Kovalyov. Three parallel task assignment problems with shared resources. IISE Transactions, Taylor & Francis, 2020, 52 (4), pp.478-485. ⟨10.1080/24725854.2019.1680907⟩. ⟨hal-02437934⟩

Share

Metrics

Record views

11

Files downloads

4