IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-319-26024-2_7.html
   My bibliography  Save this book chapter

Meta-RaPS for a Bi-objective Unrelated Parallel Machine Scheduling Problem

In: Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling

Author

Listed:
  • Nixon Dcoutho

    (Northern Illinois University)

  • Reinaldo Moraga

    (Northern Illinois University)

Abstract

This chapter discusses the capability and effectiveness of a Meta-heuristic for Randomized Priority Search to solve multi-objective problems. The multi-objective problem of unrelated parallel machine scheduling is considered in the chapter. The two objectives to minimize are total weighted tardiness and total weighted completion time. An existing construction rule in the literature named Apparent Tardiness Cost-bi heuristic is used as the basis for the meta-heuristic construction phase to generate non-dominated solutions. The computational results obtained are promising when results of the meta-heuristic approach proposed are compared with those of the original construction rule. This chapter illustrates that the meta-heuristic approach proposed is effective and flexible enough to generate Pareto-frontiers in order to solve multi-objective scheduling problems by modifying a simple existing heuristic found in the literature.

Suggested Citation

  • Nixon Dcoutho & Reinaldo Moraga, 2016. "Meta-RaPS for a Bi-objective Unrelated Parallel Machine Scheduling Problem," International Series in Operations Research & Management Science, in: Ghaith Rabadi (ed.), Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling, edition 1, chapter 0, pages 127-139, Springer.
    • Handle: RePEc:spr:isochp:978-3-319-26024-2_7
    DOI: 10.1007/978-3-319-26024-2_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:isochp:978-3-319-26024-2_7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.