Skip to main content
SpringerLink
Log in

Time-cost trade-off analysis of a priority based assignment problem

OPSEARCH Aims and scope Submit manuscript

Cite this article

Abstract

In this paper, a bi-objective priority based assignment problem (BPBAP) related to an industrial project, is considered in which, depending upon the work breakdown structure, the n tasks involved in the project are divided into two categories. One of the categories consists of m primary tasks and the other one consists of \((n-m)\) secondary tasks (for \(m<n\)). The project is such that the secondary tasks can be executed only after the primary tasks are finished, however, the tasks within each category may be executed simultaneously. This problem is a special case of categorized assignment scheduling problem, discussed extensively in literature. The BPBAP is studied with the objective of minimizing simultaneously, the two criteria namely, total execution time and total assignment cost of the project which are equal to the sum of execution times and assignment costs respectively, of primary and secondary tasks. Generally, it is not possible to optimize both the objectives simultaneously, therefore, there is a need to do time-cost trade-off analysis of the problem. Since, the present problem is based on two-stage execution of the project (one stage for each category of tasks), therefore, a criteria based iterative algorithm considering all the possible combinations of the parameters of both the categories, is developed that finds all the non-dominated points of BPBAP in a polynomial time. Numerical illustrations are provided in the support of theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Data availibility statement

Not applicable.

Abbreviations

BPBAP:

Bi-objective priority based assignment problem

CMAP:

Cost minimizing assignment problem

TMAP:

Time minimizing assignment problem

OFS:

Optimal feasible solution

OMFS:

Optimal M-feasible solution

CBIA:

Criteria based iterative algorithm

HCV:

Heavy commercial vehicle

References

  1. Adiche, C., Aider, M.: A hybrid method for solving the multi-objective assignment problem. J. Math. Model. Algorithms 9, 149–164 (2010)

    Google Scholar 

  2. Aggarwal, V., Tikekar, V.G., Puri, L.F.: Bottleneck assignment problems under categorization. Comput. Oper. Res. 13(1), 11–26 (1986)

    Google Scholar 

  3. Aneja, Y.P., Nair, K.P.K.: Bi-criteria transportation problem. Manag. Sci. 25, 73–78 (1979)

    Google Scholar 

  4. Bansal, S., Puri, M.C.: A min-max problem. ZOR 24, 191–200 (1980)

    Google Scholar 

  5. Barr, R.S., Glover, F., Klingman, D.: The alternating basis algorithm for assignment problems. Math. Programm. 13, 1–13 (1977)

    Google Scholar 

  6. Belhoul, L., Galand, L., Vanderpooten, D.: An efficient procedure for finding best compromise solutions to the multi-objective assignment problem. Comput. Oper. Res. 49, 97–106 (2014)

    Google Scholar 

  7. Bertsekas, D.P.: A new algorithm for the assignment problem. Math. Programm. 21, 152–171 (1981)

    Google Scholar 

  8. Bhatia, H.L.: Time minimizing assignment problem. Syst. Cybern. Manag. 6, 75–83 (1977)

    Google Scholar 

  9. Bianco, L., Caramia, M.: Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm. 4OR 10(4), 361–377 (2012)

    Google Scholar 

  10. Brandt, A., Intrator, Y.: The assignment problem with three job categories. Casopis Pro Pestovani Matematiky 96, 8–11 (1971)

    Google Scholar 

  11. Carpento, G., Toth, P.: Algorithm for the solution of the bottleneck assignment problem. Computing 27, 179–187 (1981)

    Google Scholar 

  12. Chandra, S., Jayadeva, Mehra, A., : Numerical Optimization and Applications. Narosa Publishing House, New Delhi (2009)

  13. Chircop, K., Mangion, D.Z.: On epsilon-consraint based methods for the generation of Pareto frontiers. J. Mech. Eng. Autom. 3(5), 279–289 (2013)

    Google Scholar 

  14. De, P.K., Yadav, B.: An algorithm to solve multi-objective assignment problem using interactive fuzzy goal programming approach. Int. J. Contemp. Math. Sci. 6(34), 1651–1662 (2011)

    Google Scholar 

  15. Dell’Amico, M., Maffioli, F., Martello, S.: Linear assignment. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliography in Combinatorial Optimization, pp. 355–371. Wiley, Chichester (1997)

    Google Scholar 

  16. Derigs, U.: The shortest augmenting path method for solving assignment problems — motivation and computational experience. Ann Oper Res 4, 57–102 (1985). https://doi.org/10.1007/BF02022037

    Article  Google Scholar 

  17. Dinagar, D.S., Palanivel, K.: On quadratic membership functions in solving assignment problem under fuzzy environment. J. Fuzzy Math. 21, 59–68 (2013)

    Google Scholar 

  18. Dinagar, D.S., Thiripurasundari, K.: A new method for finding the cost of fuzzy assignment problem using genetic algorithm of artificial intelligence. Int. Electron. J. Pure Appl. Math. 8, 13–21 (2014)

    Google Scholar 

  19. Easterfield, T.E.: A combinatorial algorithm. J. Lond. Math. Soc. 21, 219–226 (1946)

    Google Scholar 

  20. Edmonds, J., Karp, M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. Assoc. Comput. Mach. 19(2), 249–264 (1972)

    Google Scholar 

  21. Fulkerson, R., Glicksberg, I., Gross, O.: A production line assignment problem. Technical Report RM- 1102, The Rand Corporation, Sta. Monica, CA (1953)

  22. Garfinkel, R.: An improved algorithm for the bottleneck assignment problem. Oper. Res. 19, 1747–1751 (1971)

    Google Scholar 

  23. Geetha, S., Nair, K.P.K.: A variation of the assignment problem. Eur. J. Oper. Res. 68, 422–426 (1993)

    Google Scholar 

  24. Glover, F., Karney, D., Klingman, D.: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems. Networks 4(3), 191–212 (1974)

    Google Scholar 

  25. Gupta, P., Mehlavat, M.K.: A new possiblistic programming approach for solving fuzzy multi-objective assignment problem. IEEE Trans. Fuzzy Syst. 22(1), 16–34 (2014)

    Google Scholar 

  26. Hadley, G.: Linear Programming. Addison-Wesley Publishing Company Inc, Boston (1962)

    Google Scholar 

  27. Haimes, Y., Lasden, L., Wismer, D.: On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst. Man Cybern. 1, 296–297 (1971)

    Google Scholar 

  28. Hammadi, A.M.K.: Solving multi-objective assignment problem using tabu search algorithm. Global J. Pure Appl. Math. 13(9), 4747–4764 (2017)

    Google Scholar 

  29. Hatch, R.S.: Bench marks comparing transportation codes based on primal simplex and primal-dual algorithms. Oper. Res. 23, 1167–1171 (1975)

    Google Scholar 

  30. Hung, M.S., Rom, W.O.: Solving the assignment problem by relaxation. Oper. Res. 28, 969–982 (1980)

    Google Scholar 

  31. Swarup, K., Gupta, P.K., Man, M.: Operations Research. Sultan Chand and Sons, New Delhi (2007)

    Google Scholar 

  32. Karsu, O., Azizoğlu, M.: Bi-criteria multi-resource generalized assignment problem. Naval Res. Logist. 61, 621–636 (2014)

  33. Kaur, P., Sharma, A., Verma, V., Dahiya, K.: A priority based assignment problem. Appl. Math. Model. 40(17–18), 7784–7795 (2016)

    Google Scholar 

  34. Krumke, S.O., Thielen, C.: The generalized assignment problem with minimum quantities. Eur. J. Oper. Res. 228, 46–55 (2013)

    Google Scholar 

  35. Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2, 83–97 (1955)

    Google Scholar 

  36. Lawler, E.L.: Combinatorial optimization. Networks and Matroids, Holt, Rinehart and Winston, New York (1976)

  37. McGinnis, L.F.: Implementation and testing of a primal-dual algorithm for the assignment problem. Oper. Res. 31, 277–291 (1983)

    Google Scholar 

  38. Mehlawat, M., Kumar, S.: A goal programming approach for a multi-objective multi-choice assignment problem. Optimization 63, 1549–1563 (2014)

    Google Scholar 

  39. Nomani, A.N., Ali, I., Ahmed, A.: A new approach for solving multi-objective transportation problems. Int. J. Manag. Sci. Eng. Manag. 12(3), 165–173 (2017)

    Google Scholar 

  40. Pedersen, C.R., Nielsen, L.R., Andersen, K.A.: The bi-criterion multi-modal assignment problem: introduction, analysis and experimental results. INFORMS J. Comput. 20(3), 400–411 (2008)

    Google Scholar 

  41. Pentico, D.W.: Assignment problem: a golden anniversary survey. Eur. J. Oper. Res. 176, 774–793 (2007)

    Google Scholar 

  42. Pinker, E., Szmerekovsky, J., Tilson, V.: On the complexity of project scheduling to minimize exposed time. Eur. J. Oper. Res. 237, 448–453 (2014)

    Google Scholar 

  43. Punnen, A.P., Aneja, Y.P.: Categorized assignment scheduling: a tabu search approach. J. Oper. Res. Soc. 44(7), 673–679 (1993)

    Google Scholar 

  44. Ravindran, A., Ramaswamy, V.: On the bottleneck assignment problem. J. Optim. Theory Appl. 21(4), 451–458 (1977)

    Google Scholar 

  45. Richey, M.B., Punnen, A.P.: Minimum weight perfect bipartite matching and spanning trees under categorisation. Discrete Appl. Math. 39, 147–153 (1992)

    Google Scholar 

  46. Ryu, S., Chen, A., Xu, X., Choi, K.: A dual approach for solving the combined distribution and assignment problem with link capacity constraints. Netw. Spat. Econ. 14, 245–270 (2014)

    Google Scholar 

  47. Sarin, S.C., Sherali, H.D., Kim, S.K.: A branch and price approach for the stochastic generalized assignment problem. Naval Res. Logist. 61, 131–143 (2014)

    Google Scholar 

  48. Seshan, C.P.: Some generalisations of the time minimising assignment problems. J. Oper. Res. Soc. 32(6), 489–494 (1981)

    Google Scholar 

  49. Srinivasan, V., Thompson, G.L.: Accelerated algorithms for labeling and relabeling of trees with applications to distribution problems. J. Assoc. Comput. Mach. 19, 712–726 (1972)

    Google Scholar 

  50. Taha, H.A.: Operations Research: An Introduction. Prentice-Hall of India, Upper Saddle River (2003)

    Google Scholar 

  51. Thorani, Y.L.P., Ravi Shankar, N.: Fuzzy assignment problem with generalized fuzzy numbers. Appl. Math. Sci. 7, 3511–3537 (2013)

    Google Scholar 

  52. Tomizawa, N.: On some techniques useful for solution of transportation network problems. Networks 1(2), 173–194 (1971)

    Google Scholar 

  53. Tuyttens, D., Teghem, J., Fortemps, P.H., Nieuwenhuyze, K.V.: Performance of the MOSA method for the bi-criteria assignment problem. J. Heuristics 6, 295–310 (2000)

    Google Scholar 

  54. Verma, V.: Optimization over a polyhedral domain: some aspects. Ph.D. Thesis, IIT Delhi (1980)

  55. Xu, T.J., Yang, P., Liu, Z.Q.: Mine ore blending planning and management based on the fuzzy multi-objective optimization algorithm. In: Proceedings of the 2008 International Seminar on Bussiness and Information Management, Wuhan, 2, pp. 38–41 (2008)

  56. Yadaiah, V., Haragopal, V.V.: A new approach of solving single objective unbalanced assignment problem. Am. J. Oper. Res. 6, 81–89 (2016)

    Google Scholar 

  57. Yadaiah, V., Haragopal, V.V.: Multi-objective optimization of time-cost-quality using Hungarian algorithm. Am. J. Oper. Res. 6, 31–35 (2016)

    Google Scholar 

  58. Yang, L., Liu, B.: A multi-objective fuzzy assignment problem: new model and algorithm. In: Proceedings of IEEE international conference on fuzzy systems, pp. 551–556 (2005)

  59. Zhang, H., Beltran-Royo, C., Ma, L.: Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers. Ann. Oper. Res. 207, 261–278 (2013)

    Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for their valuable suggestions and comments which helped in improving the manuscript considerably.

Funding

Not applicable.

Author information

Authors and Affiliations

  1. UIET, Panjab University, Chandigarh, 160014, India

    Prabhjot Kaur & Kalpana Dahiya

  2. Department of Mathematics, Panjab University, Chandigarh, 160014, India

    Vanita Verma

Authors
  1. Prabhjot Kaur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kalpana Dahiya
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vanita Verma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kalpana Dahiya.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Code availabilty

Not applicable.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kaur, P., Dahiya, K. & Verma, V. Time-cost trade-off analysis of a priority based assignment problem. OPSEARCH 58, 448–482 (2021). https://doi.org/10.1007/s12597-020-00483-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-020-00483-4

Keywords

Mathematics Subject Classification

JEL Classification

search

Navigation