Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Two-machine open-shop scheduling with rejection to minimize the makespan

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

In this paper, we consider the two-machine open-shop scheduling problem with rejection. The objective is to minimize the sum of the makespan of accepted jobs and the total rejection cost of rejected jobs. We show that the problem is NP-hard even in three special cases and then provide a pseudo-polynomial time algorithm for this problem, which means that the problem is actually NP-hard in the ordinary sense. This answers an open problem posed by Shabtay et al. in (J Schedul 16:3–28, 2013). Finally, a 2-approximation algorithm and an FPTAS are designed for the problem.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. SIAM J Discret Math 13:64–78

    Article  Google Scholar 

  • Engels DW, Karger DR, Kolliopoulos SG, Sengupta S, Uma RN, Wein J (2003) Techniques for scheduling with rejection. J Algorithms 49:175–191

    Article  Google Scholar 

  • Epstein L, Noga J, Woeginger GJ (2002) On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operat Res Lett 30:415–420

    Article  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractablity: a guide to the theory of NP-completeness. Freeman, San Francisco

    Google Scholar 

  • Gonzalez T, Sahni S (1976) Open shop scheduling to minimize finish time. J ACM 23:665–679

    Article  Google Scholar 

  • Hoogeveen H, Skutella M, Woeginger GJ (2003) Preemptive scheduling with rejection. Math Programm 94:361–374

    Article  Google Scholar 

  • Kellerer H, Strusevich V (2013) Fast approximation schemes for boolean programming and scheduling problems related to positive convex Half-Product. Euro J Operat Res 228:24–32

    Article  Google Scholar 

  • Ma R, Yuan JJ (2013) Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost. Inf Process Lett 113:593–598

    Article  Google Scholar 

  • Seiden S (2001) Preemptive multiprocessor scheduling with rejection. Theor Comput Sci 262:437–458

    Article  Google Scholar 

  • Shabtay D, Gaspar N (2012) Two-machine flow-shop scheduling with rejection. Comput Operat Res 39:1087–1096

    Article  Google Scholar 

  • Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Schedul 16:3–28

    Article  Google Scholar 

  • Steiner G, Zhang R (2011) Revised delivery-time quotation in scheduling with tardiness penalties. Operat Res 59:1504–1511

    Article  Google Scholar 

  • Strusevich VS (1991) Two machine super-shop scheduling problem. J Operat Res Soc 42:479–492

    Article  Google Scholar 

  • Woeginger GJ (2000) When does a dynamic programming formulation guarantee the exitence of an FPTAS? INFORMS J Comput 12:57–74

    Article  Google Scholar 

  • Zhang LQ, Lu LF, Yuan JJ (2009) Single machine scheduling with release dates and rejection. Europ J Operat Res 198:975–978

    Article  Google Scholar 

  • Zhang LQ, Lu LF, Li SS (2015) New results on two-machine flow-shop scheduling with rejection. J Comb Optim (in press). doi:10.1007/s10878-015-9836-3

Download references

Acknowledgments

This research was supported in part by Grants NSFC (11426094, 11171313 and 11271338), and NSF-Henan (15IRTSTHN006).

Author information

Authors and Affiliations

  1. College of Information and Management Science, Henan Agricultural University, Zhengzhou, 450003, Henan, People’s Republic of China

    Liqi Zhang

  2. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, 450001, Henan, People’s Republic of China

    Lingfa Lu & Jinjiang Yuan

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

  3. Jinjiang Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lingfa Lu.

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. & Yuan, J. Two-machine open-shop scheduling with rejection to minimize the makespan. OR Spectrum 38, 519–529 (2016). https://doi.org/10.1007/s00291-015-0409-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-015-0409-8

Keywords

Search

Navigation