IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v70y1997i0p75-9210.1023-a1018903027868.html
   My bibliography  Save this article

Single machine scheduling with batch set-up times to minimize maximum lateness

Author

Listed:
  • A.M.A. Hariri
  • C.N. Potts

Abstract

This paper considers a problem of scheduling N jobs on a single machine to minimize the maximum lateness. A partitioning of the jobs into F families is given. A set-up time is required at the start of each batch, where a batch is a largest set of contiguously scheduled jobs from the same family. We propose a single-batch heuristic in which all jobs of a family form a batch, and a double-batch heuristic in which each family is partitioned into at most two batches according to the due dates of its jobs. Both heuristics require O(N log N) time. It is shown that the single-batch heuristic has a worst-case performance ratio of 2 -1/F, whereas a composite heuristic which selects the better of the schedules generated by the single- and double-batch heuristics has a worst-case performance ratio of 5/3 for arbitrary F. Lower bounds are derived and are incorporated in a branch and bound algorithm. This algorithm uses a procedure to reduce the size of the problem, and employs a branching rule which forces pairs of jobs to lie in the same batch or in different batches. Computational tests show that the algorithm is effective in solving problems with up to 50 jobs. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • A.M.A. Hariri & C.N. Potts, 1997. "Single machine scheduling with batch set-up times to minimize maximum lateness," Annals of Operations Research, Springer, vol. 70(0), pages 75-92, April.
    • Handle: RePEc:spr:annopr:v:70:y:1997:i:0:p:75-92:10.1023/a:1018903027868
    DOI: 10.1023/A:1018903027868
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018903027868
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018903027868?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. F Jin & J N D Gupta & S Song & C Wu, 2010. "Single machine scheduling with sequence-dependent family setups to minimize maximum lateness," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1181-1189, July.
    2. Kenneth R. Baker, 1999. "Heuristic procedures for scheduling job families with setups and due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(8), pages 978-991, December.
    3. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
    4. Baker, Kenneth R. & Magazine, Michael J., 2000. "Minimizing maximum lateness with job families," European Journal of Operational Research, Elsevier, vol. 127(1), pages 126-139, November.
    5. Guruprasad Pundoor & Zhi‐Long Chen, 2005. "Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 571-589, September.
    6. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    7. 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.
    8. 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.
    9. 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.

    More about this item

    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:annopr:v:70:y:1997:i:0:p:75-92:10.1023/a:1018903027868. 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.