IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v23y2017i2d10.1007_s10732-017-9325-1.html
   My bibliography  Save this article

Scatter search for minimizing weighted tardiness in a single machine scheduling with setups

Author

Listed:
  • Miguel A. González

    (University of Oviedo)

  • Juan José Palacios

    (University of Oviedo)

  • Camino R. Vela

    (University of Oviedo)

  • Alejandro Hernández-Arauzo

    (University of Oviedo)

Abstract

Single machine scheduling problems have many real-life applications and may be hard to solve due to the particular characteristics of some production environments. In this paper, we tackle the single machine scheduling problem with sequence-dependent setup times with the objective of minimizing the weighted tardiness. To solve this problem, we propose a scatter search algorithm which uses path relinking in its core. This algorithm is enhanced with some procedures to speed-up the neighbors’ evaluation and with some diversification and intensification techniques, the latter taking some elements from iterated local search. We conducted an experimental study across a well-known set of instances to analyze the contribution of each component to the overall performance of the algorithm, as well as to compare our proposal with the state-of-the-art metaheuristics, obtaining competitive results. We also propose a new benchmark with larger and more challenging instances and provide the first results for them.

Suggested Citation

  • Miguel A. González & Juan José Palacios & Camino R. Vela & Alejandro Hernández-Arauzo, 2017. "Scatter search for minimizing weighted tardiness in a single machine scheduling with setups," Journal of Heuristics, Springer, vol. 23(2), pages 81-110, June.
    • Handle: RePEc:spr:joheur:v:23:y:2017:i:2:d:10.1007_s10732-017-9325-1
    DOI: 10.1007/s10732-017-9325-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-017-9325-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-017-9325-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mauricio G.C. Resende & Celso C. Ribeiro & Fred Glover & Rafael Martí, 2010. "Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 87-107, Springer.
    2. Jon K. Wilbrecht & William B. Prescott, 1969. "The Influence of Setup Time on Job Shop Performance," Management Science, INFORMS, vol. 16(4), pages 274-280, December.
    3. Anghinolfi, Davide & Paolucci, Massimo, 2009. "A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 193(1), pages 73-85, February.
    4. Raman, Narayan & Rachamadugu, Ram V. & Talbot, F. Brian, 1989. "Real-time scheduling of an automated manufacturing center," European Journal of Operational Research, Elsevier, vol. 40(2), pages 222-242, May.
    5. Sen, Tapan & Gupta, Sushil K, 1984. "A state-of-art survey of static scheduling research involving due dates," Omega, Elsevier, vol. 12(1), pages 63-76.
    6. Stephen C. Graves, 1981. "A Review of Production Scheduling," Operations Research, INFORMS, vol. 29(4), pages 646-675, August.
    7. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 2006. "Some aspects of scatter search in the flow-shop problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 654-666, March.
    8. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    9. Russell, Robert A. & Chiang, Wen-Chyuan, 2006. "Scatter search for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 169(2), pages 606-622, March.
    10. Juan Pantrigo & Rafael Martí & Abraham Duarte & Eduardo Pardo, 2012. "Scatter search for the cutwidth minimization problem," Annals of Operations Research, Springer, vol. 199(1), pages 285-304, October.
    11. Leonard Adler & Nelson Fraiman & Edward Kobacker & Michael Pinedo & Juan Carlos Plotnicoff & Tso Pang Wu, 1993. "BPSS: A Scheduling Support System for the Packaging Industry," Operations Research, INFORMS, vol. 41(4), pages 641-648, August.
    12. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    13. Manuel Laguna & Francisco Gortázar & Micael Gallego & Abraham Duarte & Rafael Martí, 2014. "A black-box scatter search for optimization problems with integer variables," Journal of Global Optimization, Springer, vol. 58(3), pages 497-516, March.
    14. Naderi, Bahman & Ruiz, Rubén, 2014. "A scatter search algorithm for the distributed permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 323-334.
    15. C Gagné & W L Price & M Gravel, 2002. "Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(8), pages 895-906, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Wenzhu Liao & Tong Wang, 2018. "Promoting Green and Sustainability: A Multi-Objective Optimization Method for the Job-Shop Scheduling Problem," Sustainability, MDPI, vol. 10(11), pages 1-19, November.
    2. Ronghua Meng & Yunqing Rao & Qiang Luo, 2020. "Modeling and solving for bi-objective cutting parallel machine scheduling problem," Annals of Operations Research, Springer, vol. 285(1), pages 223-245, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vallada, Eva & Ruiz, Rubén, 2010. "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, Elsevier, vol. 38(1-2), pages 57-67, February.
    2. 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.
    3. Ruiz, Ruben & Maroto, Concepcion, 2006. "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility," European Journal of Operational Research, Elsevier, vol. 169(3), pages 781-800, March.
    4. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    5. Pflughoeft, K. A. & Hutchinson, G. K. & Nazareth, D. L., 1996. "Intelligent decision support for flexible manufacturing: Design and implementation of a knowledge-based simulator," Omega, Elsevier, vol. 24(3), pages 347-360, June.
    6. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    7. Victor Portougal & David J. Robb, 2000. "Production Scheduling Theory: Just Where Is It Applicable?," Interfaces, INFORMS, vol. 30(6), pages 64-76, December.
    8. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    9. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    10. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    11. Hatami, Sara & Ruiz, Rubén & Andrés-Romano, Carlos, 2015. "Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 169(C), pages 76-88.
    12. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    13. Kalczynski, Pawel J. & Kamburowski, Jerzy, 2009. "An empirical analysis of the optimality rate of flow shop heuristics," European Journal of Operational Research, Elsevier, vol. 198(1), pages 93-101, October.
    14. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    15. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    16. Shen, Liji & Dauzère-Pérès, Stéphane & Neufeld, Janis S., 2018. "Solving the flexible job shop scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 265(2), pages 503-516.
    17. Benavides, Alexander J. & Ritt, Marcus & Miralles, Cristóbal, 2014. "Flow shop scheduling with heterogeneous workers," European Journal of Operational Research, Elsevier, vol. 237(2), pages 713-720.
    18. Franca, Paulo M. & Mendes, Alexandre & Moscato, Pablo, 2001. "A memetic algorithm for the total tardiness single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 224-242, July.
    19. Urlings, Thijs & Ruiz, Rubén & Stützle, Thomas, 2010. "Shifting representation search for hybrid flexible flowline problems," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1086-1095, December.
    20. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.

    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:joheur:v:23:y:2017:i:2:d:10.1007_s10732-017-9325-1. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.