Zobraziť v EDS

An amalgamated approach for solving unbalanced assignment problem

Uložené v:
Podrobná bibliografia
Názov: An amalgamated approach for solving unbalanced assignment problem
Autori: Anju Khandelwal
Zdroj: Malaya Journal of Matematik; Vol. 6 No. 02 (2018): Malaya Journal of Matematik (MJM); 321-325 ; 2321-5666 ; 2319-3786
Informácie o vydavateľovi: MKD Publishing House
Rok vydania: 2018
Predmety: Unbalanced Assignment, Partial Bound Value, Hungarian Method, Distributed computing System, Mathematics
Popis: Task assignment to any computing system is a most interesting and demandable research problem. Various methodologies and techniques are available in the literature to provide the solution of such problems. The assignment problems in distributed computing systems are one of major factor to determine the performance of such systems. The Assignment problem is one of the main problems while assigning jobs to the worker or machines to the worker to get an optimal solution. The problem mentioned in this paper suggests an exhaustive search approach to the unbalanced assignment problem through partial bound optimization. The bound is based on partial bound values. This paper contains the devised technique, computational algorithm of the approach and its implementation. This study is capable to deal all such real life situations where the Jobs (tasks) are more than the number of Machine (processors). The obtain solution is under consideration that all the jobs are allotted on the available machines in an optimum way. Finally numerical example and its algorithm have been given to show the efficiency of the proposed techniques.
Druh dokumentu: article in journal/newspaper
Popis súboru: application/pdf
Jazyk: English
Relation: https://www.malayajournal.org/index.php/mjm/article/view/815/539; https://www.malayajournal.org/index.php/mjm/article/view/815
DOI: 10.26637/MJM0602/0003
Dostupnosť: https://www.malayajournal.org/index.php/mjm/article/view/815
https://doi.org/10.26637/MJM0602/0003
Rights: Copyright (c) 2018 MJM ; https://creativecommons.org/licenses/by/4.0/
Prístupové číslo: edsbas.AFF2B5F0
Databáza: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://www.malayajournal.org/index.php/mjm/article/view/815#
    Name: EDS - BASE (s4221598)
    Category: fullText
    Text: View record from BASE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Khandelwal%20A
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsbas
DbLabel: BASE
An: edsbas.AFF2B5F0
RelevancyScore: 872
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 872.436645507813
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: An amalgamated approach for solving unbalanced assignment problem
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Anju+Khandelwal%22">Anju Khandelwal</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Malaya Journal of Matematik; Vol. 6 No. 02 (2018): Malaya Journal of Matematik (MJM); 321-325 ; 2321-5666 ; 2319-3786
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: MKD Publishing House
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2018
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Unbalanced+Assignment%22">Unbalanced Assignment</searchLink><br /><searchLink fieldCode="DE" term="%22Partial+Bound+Value%22">Partial Bound Value</searchLink><br /><searchLink fieldCode="DE" term="%22Hungarian+Method%22">Hungarian Method</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+computing+System%22">Distributed computing System</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Task assignment to any computing system is a most interesting and demandable research problem. Various methodologies and techniques are available in the literature to provide the solution of such problems. The assignment problems in distributed computing systems are one of major factor to determine the performance of such systems. The Assignment problem is one of the main problems while assigning jobs to the worker or machines to the worker to get an optimal solution. The problem mentioned in this paper suggests an exhaustive search approach to the unbalanced assignment problem through partial bound optimization. The bound is based on partial bound values. This paper contains the devised technique, computational algorithm of the approach and its implementation. This study is capable to deal all such real life situations where the Jobs (tasks) are more than the number of Machine (processors). The obtain solution is under consideration that all the jobs are allotted on the available machines in an optimum way. Finally numerical example and its algorithm have been given to show the efficiency of the proposed techniques.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: article in journal/newspaper
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: https://www.malayajournal.org/index.php/mjm/article/view/815/539; https://www.malayajournal.org/index.php/mjm/article/view/815
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.26637/MJM0602/0003
– Name: URL
  Label: Availability
  Group: URL
  Data: https://www.malayajournal.org/index.php/mjm/article/view/815<br />https://doi.org/10.26637/MJM0602/0003
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: Copyright (c) 2018 MJM ; https://creativecommons.org/licenses/by/4.0/
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.AFF2B5F0
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.AFF2B5F0
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.26637/MJM0602/0003
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Unbalanced Assignment
        Type: general
      – SubjectFull: Partial Bound Value
        Type: general
      – SubjectFull: Hungarian Method
        Type: general
      – SubjectFull: Distributed computing System
        Type: general
      – SubjectFull: Mathematics
        Type: general
    Titles:
      – TitleFull: An amalgamated approach for solving unbalanced assignment problem
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Anju Khandelwal
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: Malaya Journal of Matematik; Vol. 6 No. 02 (2018): Malaya Journal of Matematik (MJM); 321-325
              Type: main
ResultId 1