IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_57.html
   My bibliography  Save this book chapter

Heuristics for Solving the Job Sequencing and Tool Switching Problem with Non-identical Parallel Machines

In: Operations Research Proceedings 2018

Author

Listed:
  • Dorothea Calmels

    (University of Passau)

  • Chandrasekharan Rajendran

    (Indian Institute of Technology Madras)

  • Hans Ziegler

    (University of Passau)

Abstract

The job sequencing and tool switching problem (SSP) is an NP-hard combinatorial optimization problem in the context of flexible manufacturing machines. Tool switches denote the interchange of tools between the global tool storage and the local tool magazine of a machine since the tool magazine capacity of the machine is limited and cannot hold all tools necessary for processing all jobs. The presented work considers the SSP with non-identical parallel machines (SSP-NPM) for the different objectives minimizing the number of tool switches, minimizing makespan and minimizing total flowtime. A simple and fast heuristic approach for the SSP-NPM is presented that, step-by-step, assigns jobs to machines and, in the process, determines the loading of the tools. The performance of the heuristics is analyzed with respect to computation time and solution quality for different objectives.

Suggested Citation

  • Dorothea Calmels & Chandrasekharan Rajendran & Hans Ziegler, 2019. "Heuristics for Solving the Job Sequencing and Tool Switching Problem with Non-identical Parallel Machines," Operations Research Proceedings, in: Bernard Fortz & Martine LabbĂ© (ed.), Operations Research Proceedings 2018, pages 459-465, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_57
    DOI: 10.1007/978-3-030-18500-8_57
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Calmels, Dorothea, 2022. "An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 297(1), pages 66-85.

    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:oprchp:978-3-030-18500-8_57. 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.