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

Extending an Agent-Based FMS Scheduling Approach with Parallel Genetic Algorithms

In: Automation, Communication and Cybernetics in Science and Engineering 2011/2012

Author

Listed:
  • Ghada Abaza

    (Stuttgart University, Institute of Industrial Automation and Software Engineering)

  • Iman Badr

    (Helwan University, Science Faculty)

  • Peter Göhner

    (Stuttgart University, Institute of Industrial Automation and Software Engineering)

  • Sabina Jeschke

    (RWTH Aachen University, IMA/ZLW)

Abstract

Flexible manufacturing systems (FMS) aim at efficiently reacting to changing market needs to stand the increasing competitiveness. This imposes efficiency and flexibility requirements on FMS scheduling. Manufacturing scheduling is the process of allocating available manufacturing resources to the set of planned jobs over time. It is an optimization process by which limited manufacturing resources are to be allocated to several jobs of different products efficiently. The agent-based scheduling approach has shown the ability to fulfill the flexibility requirement. Although this approach emphasizes flexibility, it lacks the optimization support. In this paper, an agent-based scheduling approach is extended with parallel genetic algorithms (PGA) to provide the required optimization support. Test results have shown a remarkable enhancement to the optimality of the generated schedules with respect to the predefined set of manufacturing objectives. The extended approach fulfils both flexibility and efficiency requirements on manufacturing scheduling.

Suggested Citation

  • Ghada Abaza & Iman Badr & Peter Göhner & Sabina Jeschke, 2013. "Extending an Agent-Based FMS Scheduling Approach with Parallel Genetic Algorithms," Springer Books, in: Sabina Jeschke & Ingrid Isenhardt & Frank Hees & Klaus Henning (ed.), Automation, Communication and Cybernetics in Science and Engineering 2011/2012, edition 127, pages 531-544, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-33389-7_42
    DOI: 10.1007/978-3-642-33389-7_42
    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-33389-7_42. 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.