Skip to main content
SpringerLink
Log in

Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper presents several branch and bound algorithms for a single-machine scheduling problem with batching. Jobs are partitioned into families, and a set-up time is necessary when there is a switch from processing jobs of one family to jobs of another family. The objective is to minimize the total weighted completion time. A lower bound based on Lagrangian relaxation of the machine capacity constraint is derived. Also, a multiplier adjustment method to find values of the multipliers is proposed. Computational experience with instances having up to 50 jobs shows that the lower bounds are effective in restricting the search.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B.-H. Ahn and J.-H. Hyun, Single facility multi-class job scheduling, Comp. Oper. Res. 17(1990)265–272.

    Article  Google Scholar 

  2. H. Belouadah and C.N. Potts, Scheduling identical parallel machines to minimize total weighted completion time, Discrete Appl. Math. 48(1994)201–218.

    Article  Google Scholar 

  3. H.A.J. Crauwels, C.N. Potts and L.N. Van Wassenhove, Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time, Ann. Oper. Res. 70 (1997)261–79.

    Article  Google Scholar 

  4. M.L. Fisher, A dual algorithm for the one-machine scheduling problem, Math. Prog. 11(1976)229–251.

    Article  Google Scholar 

  5. J.B. Ghosh, Batch scheduling to minimize total completion time, Oper. Res. Lett. 16(1994)271–275.

    Article  Google Scholar 

  6. J.N.D. Gupta, Single facility scheduling with multiple job classes, Euro. J. Oper. Res. 8(1988) 42–45.

    Article  Google Scholar 

  7. A.M.A. Hariri and C.N. Potts, An algorithm for single machine sequencing with release dates to minimize total weighted completion time, Discrete Appl. Math. 5(1983)99–109.

    Article  Google Scholar 

  8. E.L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Discrete Appl. Math. 2(1978)75–90.

    Article  Google Scholar 

  9. A.J. Mason, Genetic algorithms and scheduling problems, Ph.D. Thesis, Department of Engineering, University of Cambridge, UK, 1992.

    Google Scholar 

  10. A.J. Mason and E.J. Anderson, Minimizing flow time on a single machine with job classes and setup times, Naval Res. Logist. 38(1991)333–350.

    Google Scholar 

  11. C.L. Monma and C.N. Potts, On the complexity of scheduling with batch setup times, Oper. Res. 37(1989)798–804.

    Article  Google Scholar 

  12. C.N. Potts and L.N. Van Wassenhove, An algorithm for single machine sequencing with deadlines to minimize total weighted completion time, Euro. J. Oper. Res. 12(1983)379–387.

    Article  Google Scholar 

  13. C.N. Potts and L.N. Van Wassenhove, A branch and bound algorithm for the total weighted tardiness problem, Oper. Res. 33(1985)363–377.

    Google Scholar 

  14. C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity, J. Oper. Res. Soc. 43(1992)395–406.

    Article  Google Scholar 

Download references

Authors
  1. H.A.J. Crauwels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A.M.A. Hariri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C.N. Potts
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. L.N. Van Wassenhove
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crauwels, H., Hariri, A., Potts, C. et al. Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time. Annals of Operations Research 83, 59–76 (1998). https://doi.org/10.1023/A:1018920416308

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018920416308

Keywords

Search

Navigation