An improved algorithm for two stage time minimization assignment problem

Ekta Jain (), Kalpana Dahiya (), Anuj Sharma () and Vanita Verma ()
Additional contact information
Ekta Jain: Panjab University
Kalpana Dahiya: Panjab University
Anuj Sharma: Panjab University
Vanita Verma: Panjab University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 2, No 18, 713-736

Abstract: Abstract The paper develops a technique to solve two stage time minimization assignment problem dealing with the allocation of n jobs to n persons in two stages where $$n_1$$ n 1 out of n jobs are primary jobs and constitute Stage-I and rest of the jobs are secondary jobs constituting Stage-II. It is assumed that each person can be assigned to one job only and each job is to be done by exactly one person. Further, in a particular stage, all the jobs are commenced simultaneously. Stage-II jobs are commenced only after Stage-I jobs are finished and the objective is to find an assignment which minimizes the total completion time of Stage-I and Stage-II jobs. Numerical examples are provided to support the theory. The proposed algorithm has been coded in MATLAB and tested on different problems with n varying from 10 to 100.

Keywords: Assignment; Bottleneck; Time minimization; Two stage (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0318-2 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:jcomop:v:37:y:2019:i:2:d:10.1007_s10878-018-0318-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0318-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().