We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM.
- Authors
JAIN, EKTA; DAHIYA, KALPANA; VERMA, VANITA
- Abstract
We discuss a bi-objective two-stage assignment problem (BiTSAP) that aims at minimizing two objective functions: one comprising a nonlinear cost function defined explicitly in terms of assignment variables and the other a total completion time. A two-stage assignment problem deals with the optimal allocation of n jobs to n agents in two stages, where $n_1$ out of n jobs are primary jobs which constitute Stage-1 and the rest of the jobs are secondary jobs constituting Stage-2. The paper proposes an algorithm that seeks an optimal solution for a BiTSAP in terms of various efficient time-cost pairs. An algorithm for ranking all feasible assignments of a two-stage assignment problem in order of increasing total completion time is also presented. Theoretical justification and numerical illustrations are included to support the proposed algorithms.
- Subjects
COST functions; ASSIGNMENT problems (Programming); NONLINEAR functions; LINEAR orderings
- Publication
ANZIAM Journal, 2022, Vol 64, Issue 2, p183
- ISSN
1446-1811
- Publication type
Article
- DOI
10.1017/S1446181122000116