IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v70y1997i0p261-27910.1023-a1018978322417.html
   My bibliography  Save this article

Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time

Author

Listed:
  • H.A.J. Crauwels
  • C.N. Potts
  • L.N. Van Wassenhove

Abstract

Local search heuristics are developed for a problem of scheduling a single machine to minimize the total weighted completion time. The jobs are partitioned into families, and a set-up time is necessary when there is a switch in processing jobs from one family to jobs of another family. Four alternative neighbourhood search methods are developed: multi-start descent, simulated annealing, threshold accepting and tabu search. The performance of these heuristics is evaluated on a large set of test problems, and the results are also compared with those obtained by a genetic algorithm. The best results are obtained with the tabu search method for smaller numbers of families and with the genetic algorithm for larger numbers of families. In combination, these methods generate high quality schedules at relatively modest computational expense. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • H.A.J. Crauwels & C.N. Potts & L.N. Van Wassenhove, 1997. "Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time," Annals of Operations Research, Springer, vol. 70(0), pages 261-279, April.
  • Handle: RePEc:spr:annopr:v:70:y:1997:i:0:p:261-279:10.1023/a:1018978322417
    DOI: 10.1023/A:1018978322417
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018978322417
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1018978322417?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.

    Citations

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


    Cited by:

    1. Tomasz Gawroński, 2012. "Optimization of setup times in the furniture industry," Annals of Operations Research, Springer, vol. 201(1), pages 169-182, December.
    2. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    3. Dunstall, Simon & Wirth, Andrew, 2005. "A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines," European Journal of Operational Research, Elsevier, vol. 167(2), pages 283-296, December.
    4. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
    5. Liji Shen & Lars Mönch & Udo Buscher, 2013. "An iterative approach for the serial batching problem with parallel machines and job families," Annals of Operations Research, Springer, vol. 206(1), pages 425-448, July.
    6. S Karabatı & C Akkan, 2006. "Minimizing sum of completion times on a single machine with sequence-dependent family setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 271-280, March.
    7. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    8. 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.
    9. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.

    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:annopr:v:70:y:1997:i:0:p:261-279:10.1023/a:1018978322417. 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.