IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-1123-9_4.html
   My bibliography  Save this book chapter

Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization

In: Just-in-Time Systems

Author

Listed:
  • Eva Vallada

    (Universidad Politécnica de Valencia)

  • Rubén Ruiz

    (Universidad Politécnica de Valencia)

Abstract

This work deals with the unrelated parallel machine scheduling problem with machine and job-sequence dependent setup times. The studied objective is the minimization of the total weighted earliness and tardiness. We study existing Mixed Integer Programming (MIP) mathematical formulations. A genetic algorithm is proposed, which includes a procedure for inserting idle times in the production sequence in order to improve the objective value. We also present a benchmark of small and large instances to carry out the computational experiments. After an exhaustive computational and statistical analysis, the conclusion is that the proposed method shows a good performance.

Suggested Citation

  • Eva Vallada & Rubén Ruiz, 2012. "Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization," Springer Optimization and Its Applications, in: Roger Z. Ríos-Mercado & Yasmín A. Ríos-Solís (ed.), Just-in-Time Systems, chapter 0, pages 67-90, Springer.
    • Handle: RePEc:spr:spochp:978-1-4614-1123-9_4
    DOI: 10.1007/978-1-4614-1123-9_4
    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. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    2. Adel Kacem & Abdelaziz Dammak, 2021. "Multi-objective scheduling on two dedicated processors," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 694-721, October.
    3. Arthur Kramer & Anand Subramanian, 2019. "A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems," Journal of Scheduling, Springer, vol. 22(1), pages 21-57, February.
    4. Mohammed-Albarra Hassan & Imed Kacem & Sébastien Martin & Izzeldin M. Osman, 2018. "On the m-clique free interval subgraphs polytope: polyhedral analysis and applications," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 1074-1101, October.

    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:spochp:978-1-4614-1123-9_4. 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.