IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v7y2016i2p76-96.html
   My bibliography  Save this article

Meta-Heuristic Algorithms to Solve Bi-Criteria Parallel Machines Scheduling Problem

Author

Listed:
  • Kawal Jeet

    (Dr. B.R. Ambedkar National Institute of Technology, Jalandhar, India)

  • Renu Dhir

    (Dr. B.R. Ambedkar National Institute of Technology, Jalandhar, India)

  • Sameer Sharma

    (D.A.V. College, Jalandhar, India)

Abstract

Parallel machine scheduling problems are classified as NP-hard problems. The direct solutions for these problems are not available and meta-heuristic algorithms are required to be used to find near-optimal solutions. In this paper, the formulations of multi-objective Artificial Bee Colony algorithm by using combination of weighted objectives, secondary storage for managing possible solutions and Genetic algorithm have been developed and applied to schedule jobs on parallel machines optimizing bi-criteria namely maximum tardiness and weighted flow time. The results obtained indicate that proposed algorithm outperforms other multi-objective algorithms in optimizing bi-criteria scheduling problems on parallel machines. Further, the sequential optimization of bi-criteria using Early Due Date (EDD) followed by Genetic Algorithm (GA) has also been investigated. The efficiencies of the proposed algorithms have been verified by numerical illustrations and statistical tests.

Suggested Citation

  • Kawal Jeet & Renu Dhir & Sameer Sharma, 2016. "Meta-Heuristic Algorithms to Solve Bi-Criteria Parallel Machines Scheduling Problem," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 7(2), pages 76-96, April.
    • Handle: RePEc:igg:jaec00:v:7:y:2016:i:2:p:76-96
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAEC.2016040105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jaec00:v:7:y:2016:i:2:p:76-96. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.