IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-00142-0_18.html
   My bibliography  Save this book chapter

A GA Based Approach for Solving Multi Criteria Project Scheduling Problems

In: Operations Research Proceedings 2008

Author

Listed:
  • Felix Bomsdorf

    (University of Cologne, Department of Information Systems and Operations Research (WINFORS))

  • Ulrich Derigs

    (University of Cologne, Department of Information Systems and Operations Research (WINFORS))

  • Elisabeth von Jagwitz

    (University of Cologne, Department of Information Systems and Operations Research (WINFORS))

Abstract

Summary In this paper we present a Genetic Algorithm (GA) for generating eficient solutions for multi criteria resource constrained project scheduling problems where conicting regular as well as non regular performance measures have to be respected (cf. [4]). The GA-scheme is similar to the one developed by [1], i.e. the genes of the genotype do not only represent activities of the phenotype but also information on the decoding scheme and modus. Since a large number of (mostly similar) solutions is usually not of great help for a planner not all efficient solutions are maintained in order to reduce complexity. Thus, we use a “relaxed Pareto operator" which does accept efficient solutions only which differ (substantially) with respect to solution quality (and structure). We have applied this procedure to solve the Movie Shoot Scheduling Problem (MSSP) and we report first results.

Suggested Citation

  • Felix Bomsdorf & Ulrich Derigs & Elisabeth von Jagwitz, 2009. "A GA Based Approach for Solving Multi Criteria Project Scheduling Problems," Springer Books, in: Bernhard Fleischmann & Karl-Heinz Borgwardt & Robert Klein & Axel Tuma (ed.), Operations Research Proceedings 2008, chapter 18, pages 111-116, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-00142-0_18
    DOI: 10.1007/978-3-642-00142-0_18
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-3-642-00142-0_18. 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.