Anzeige
Erschienen in:
22.06.2018
An improved algorithm for two stage time minimization assignment problem
Erschienen in: Journal of Combinatorial Optimization | Ausgabe 2/2019
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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\) 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.