Skip to main content
SpringerLink
Log in

Minimizing the number of tardy jobs in two-machine settings with common due date

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We consider two-machine scheduling problems with job selection. We analyze first the two-machine open shop problem and provide a best possible linear time algorithm. Then, a best possible linear time algorithm is derived for the job selection problem on two unrelated parallel machines. We also show that an exact approach can be derived for both problems with complexity \(O(p(n) \times \sqrt{2}^n)\), p being a polynomial function of n.

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.

Similar content being viewed by others

References

  • Bar-Noy A, Guha S, Naor J, Schieber B (2001) Approximating the throughput of multiple machines in real-time scheduling. SIAM J Comput 31:331–352

    Article  MathSciNet  MATH  Google Scholar 

  • Coffman EG, Leung JY-T, Ting DW (1978) Bin packing: maximizing the number of pieces packed. Acta Inform 9:263–271

    Article  MathSciNet  MATH  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326

    Article  MathSciNet  MATH  Google Scholar 

  • Jozefowska J, Jurisch B, Kubiak W (1994) Scheduling shops to minimize the weighted number of late jobs. Oper Res Lett 16:277–283

    Article  MathSciNet  MATH  Google Scholar 

  • Koulamas C, Kyparisis GJ (1998) Open shop scheduling to minimize late jobs. Nav Res Logist 45:525–532

    Article  MathSciNet  MATH  Google Scholar 

  • Lin BMT, Kononov AV (2007) Customer order scheduling to minimize the number of late jobs. Eur J Oper Res 183:944–948

    Article  MATH  Google Scholar 

  • Lenté C, Liedloff M, Soukhal A, T’kindt V (2013) On an extension of the sort & search method with application to scheduling theory. Theor Comput Sci 511:13–22

    Article  MathSciNet  MATH  Google Scholar 

  • Martello S, Toth P (2003) An exact algorithm for the two-constraint 0/1 knapsack problem. Oper Res 51:826–835

    Article  MathSciNet  MATH  Google Scholar 

  • Megiddo N, Tamir A (1993) Linear time algorithms for some separable quadratic programming problems. Oper Res Lett 13:203–211

    Article  MathSciNet  MATH  Google Scholar 

  • Murty KG (1976) Linear and combinatorial programming. Wiley, New York

    MATH  Google Scholar 

  • Woeginger GJ (2003) Exact algorithms for \(NP\)-hard problems: a survey. In: Juenger M, Reinelt G, Rinaldi G (eds) Combinatorial optimization—Eureka! You shrink! (Lecture Notes in Computer Science), vol 2570, p 185–207

Download references

Author information

Authors and Affiliations

  1. D.A.I., Politecnico di Torino, Torino, Italy

    Federico Della Croce

  2. CNR, IEIIT, Torino, Italy

    Federico Della Croce

  3. College of Business, Florida International University, Miami, USA

    Christos Koulamas

  4. Université Francois-Rabelais, CNRS, LI EA 6300, OC ERL CNRS 6305, Tours, France

    Vincent T’kindt

Authors
  1. Federico Della Croce
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos Koulamas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vincent T’kindt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Federico Della Croce.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Della Croce, F., Koulamas, C. & T’kindt, V. Minimizing the number of tardy jobs in two-machine settings with common due date. J Comb Optim 34, 133–140 (2017). https://doi.org/10.1007/s10878-016-0054-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-016-0054-4

Keywords

Search

Navigation