Skip to main content
SpringerLink
Log in

An Online Algorithm for a Problem in Scheduling with Set-ups and Release Times

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We address the problem of sequential single machine scheduling of jobs with release times, where jobs are classified into types, and the machine must be properly configured to handle jobs of a given type. The objective is to minimize the maximum flow time (time from release until completion) of any job. We consider this problem under the assumptions of sequence independent set-up times and item availability with the objective of minimizing the maximum flow time. We present an online algorithm that is O(1)-competitive, that is, always gets within a constant factor of optimal. We also show that exact offline optimization of maximum flow time is NP-hard.

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. Ahn, B.H., Hyun, J.H.: Single facility multi-class job scheduling. Comput. Oper. Res. 17, 265–272 (1990)

    Article  MATH  Google Scholar 

  2. Baker, K.R., Magazine, M.J.: Minimizing maximum lateness with job families. Eur. J. Oper. Res. 127, 126–139 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baker, K.R., Webster, S.: Scheduling groups of jobs on a single machine. Oper. Res. 43(4), 692–703 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bruno, J.L., Downey, P.: Complexity of task sequencing with deadlines, setup times and changeover costs. SIAM J. Comput. 7, 393–404 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bruno, J.L., Sethi, R.: Task sequencing in a batch environment with setup times. Performance 81–88 (1976)

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Crauwels, H.A.J., Hariri, A.M.A., Potts, C.N., Van Wassenhove, L.N.: Branch and bound algorithms for single machine scheduling with batch set-up times to minimize the total weighted completion time. Ann. Oper. Res. 83, 59–76 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. Divakaran, S., Saks, M.: An online algorithm for scheduling with job set-ups. DIMACS Technical Report 2000-34

  9. Divakaran, S., Saks, M.: Approximation algorithms for problems in scheduling with set-ups. Discrete Appl Math. 165, 719–729 (2008)

    Article  MathSciNet  Google Scholar 

  10. Dunstall, S., Wirth, A., Baker, K.R.: Lower bounds and algorithms for flow minimization on a single machine with setup times. Personal Communication with Dr. Dunstall (1999)

  11. Ghosh, J.B.: Batch scheduling to minimize maximum lateness. Oper. Res. Lett. 16, 271–275 (1994)

    Article  MATH  Google Scholar 

  12. Gupta, J.N.D.: Single facility scheduling with multiple job classes. Eur. J. Oper. Res. 33, 42–45 (1988)

    Article  MATH  Google Scholar 

  13. Hariri, A.M.A., Potts, C.N.: Single machine scheduling with batch set-up times to minimize maximum lateness. Ann. Oper. Res. 70, 75–92 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. Herrmann, J.W., Lee, C.Y.: Solving a class scheduling problem with a genetic algorithm. ORSA J. Comput. 7, 443–452 (1995)

    MATH  Google Scholar 

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

  16. Mason, A.J., Anderson, E.J.: Minimizing flow time on a single machine with job classes and set-up times. Nav. Res. Logist. 38, 335–350 (1991)

    Article  MathSciNet  Google Scholar 

  17. Monma, C.L., Potts, C.N.: On the complexity of scheduling with batch set-up times. Oper. Res. 37, 798–804 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  18. Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120, 228–249 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Schutten, J.M.J.: Shop floor scheduling with set-up times. Ph.D. Thesis (1996). Personal communication with Professor Schutten

  20. Schutten, J.M.J., Van de Velde, S.L., Zijm, W.H.M.: Single machine scheduling with release dates, due dates and family setup times. Manag. Sci. 42(8), 1165–1174 (1996)

    Article  MATH  Google Scholar 

  21. Woeginger, G.J.: A polynomial time approximation scheme for single machine sequencing with delivery times and sequence independent batch setup times. J. Sched. 1(2), 79–87 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  22. Zdrzalka, S.: Approximation algorithms for single machine sequencing with delivery times and unit batch set-up times. Eur. J. Oper. Res. 51, 199–209 (1991)

    Article  MATH  Google Scholar 

  23. Zdrzalka, S.: Analysis of approximation algorithms for single machine sequencing with delivery times and sequence independent batch set-up times. Eur. J. Oper. Res. 51, 371–380 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dhirubhai Ambani Institute of Information and Communication Technology, 4212, Faculty Block 4, Gujarat, India

    Srikrishnan Divakaran

  2. Department of Mathematics, Rutgers, The State University of New Jersey, 430, Hill Center, Piscataway, NJ, 08855, USA

    Michael Saks

Authors
  1. Srikrishnan Divakaran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Saks
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Srikrishnan Divakaran.

Additional information

A preliminary version of this paper appeared as DIMACS Technical Report 2000-34.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Divakaran, S., Saks, M. An Online Algorithm for a Problem in Scheduling with Set-ups and Release Times. Algorithmica 60, 301–315 (2011). https://doi.org/10.1007/s00453-009-9337-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-009-9337-9

Keywords

Search

Navigation