Skip to main content
SpringerLink
Log in

Scheduling problems with rejection to minimize the maximum flow time

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper considers the scheduling problem with rejection on m identical parallel machines to minimize the maximum flow time. The authors show that this problem is NP-hard even when there is a single machine and all jobs have two distinct release dates. Furthermore, the authors present a dynamic programming algorithm and two approximation algorithms to solve them.

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. Bartal Y, Leonardi S, Spaccamela A M, Sgall J, and Stougie L, Multiprocessor scheduling with rejection, SIAM Journal on Discrete Mathematics, 2000, 13: 13–64.

    Article  MathSciNet  MATH  Google Scholar 

  2. Hoogeveen H, Skutella M, and Woeginger G J, Preemptive scheduling with rejection, Mathematics Programming, 2003, 94: 94–361.

    Article  MathSciNet  MATH  Google Scholar 

  3. Engels D W, Karger D R, Kolliopoulos S G, Sengupta S, Uma R N, and Wein J, Techniques for scheduling with rejection, Journal of Algorithms, 2003, 49: 49–175.

    Article  MathSciNet  MATH  Google Scholar 

  4. Zhang L Q, Lu L F, and Yuan J J, Single machine scheduling with release dates and rejection, European Journal of Operational Research, 2009, 198: 198–975.

    MathSciNet  MATH  Google Scholar 

  5. Steiner G and Zhang R, Revised delivery-time quotation in scheduling with tardiness penalties, Operations Research, 2011, 59: 59–1504.

    Article  MathSciNet  MATH  Google Scholar 

  6. Shabtay D, Gaspar N, and Kaspi M, A survey on off-line scheduling with rejection, Journal of Scheduling, 2013, 16: 16–3.

    Article  MathSciNet  MATH  Google Scholar 

  7. Seiden S, Preemptive multiprocessor scheduling with rejection, Theoretical Computer Science, 2001, 262: 262–437.

    Article  MathSciNet  MATH  Google Scholar 

  8. Epstein L, Noga J, and Woeginger G J, On-line scheduling of unit time jobs with rejection: Minimizing the total completion time, Operations Research Letters, 2002, 30: 30–415.

    MathSciNet  MATH  Google Scholar 

  9. Dosa G and He Y, Scheduling with machine cost and rejection, Journal of Combinatorial Optimization, 2006, 12: 12–337.

    Article  MathSciNet  MATH  Google Scholar 

  10. Cao Z G and Zhang Y Z, Scheduling with rejection and non-identical job arrivals, Journal of Systems Science and Complexity, 2007, 20(4): 529–535.

    Article  MathSciNet  MATH  Google Scholar 

  11. Lu L F, Ng C T, and Zhang L Q, Optimal algorithms for single-machine scheduling with rejection to minimize the makespan, Interational Journal of Production Economics, 2011, 130: 130–153.

    Google Scholar 

  12. Ma R and Yuan J J, On-line scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost, Information Processing Letters, 2013, 113: 113–593.

    Article  MathSciNet  MATH  Google Scholar 

  13. Mastrolilli M, Scheduling to minimize max flow time: off-line and on-line algorithms, Lecture Notes in Computer Science, 2003, 2751: 2751–49.

    MathSciNet  Google Scholar 

  14. Garey M R and Johnson D S, Computers and Intractablity: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information and Management Science, Henan Agricultural University, Zhengzhou, 450003, China

    Liqi Zhang

  2. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, 450001, China

    Lingfa Lu

Authors
  1. Liqi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lingfa Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lingfa Lu.

Additional information

This research was supported by the National Nature Science Foundation of China under Grant Nos. 11426094, 11271338 and U1504103.

This paper was recommended for publication by Editor WANG Shouyang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, L., Lu, L. Scheduling problems with rejection to minimize the maximum flow time. J Syst Sci Complex 29, 1293–1301 (2016). https://doi.org/10.1007/s11424-016-4187-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-016-4187-4

Keywords

Search

Navigation