Skip to main content
SpringerLink
Log in

Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed

  • Technical Note
  • Published:
Journal of the Operational Research Society

Abstract

We address the bicriteria problem of minimizing the number of tardy jobs and maximum earliness on a single machine where machine idle time is allowed. We show that the problem of minimizing the number of tardy jobs while maximum earliness is kept at its minimum value of zero is polynomially solvable. We present polynomial time algorithms for the maximum earliness problem subject to no tardy jobs and the maximum earliness problem for a given set of tardy jobs. Finally, we discuss the use of the latter algorithm in generating all efficient schedules.

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

  • Lee CY and Vairaktarakis GL (1993). Complexity of single machine hierarchical scheduling: a survey. Complex Numer Optim 19: 269–298.

    Article  Google Scholar 

  • Hoogeveen JA (1992). Single machine bicriteria scheduling. PhD thesis. CWI, Amsterdam.

  • Garey MR, Tarjan RE and Wilfong GT (1988). One processor scheduling with symmetric earliness and tardiness penalties. Math Opl Res 13: 330–348.

    Article  Google Scholar 

  • Hoogeveen JA and van de Velde S (1997). A single machine scheduling model for coordinating logistics activities in simple supply chain. Management Report No 30(13), Rotterdam School of Management, Erasmus University.

  • Koksalan M, Azizoglu M and Kondakci S (1998). Minimizing flow time and maximum earliness on a single machine. IIE Trans 30: 192–200.

    Google Scholar 

  • Azizoglu M, Kondakci S and Koksalan M (1997). Single machine scheduling with two criteria: maximum earliness and number tardy. Technical Report No: 97–02. Department of Industrial Engineering, METU, Ankara.

  • Moore JM (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Mngt Sci 15: 102–109.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Hall N, Posner M and Potts C (1998). Scheduling with finite capacity output buffers. Opns Res 46: 584–597.

    Google Scholar 

  • Hoogeveen JA (1996). Minimizing maximum promptness and maximum lateness on a single machine. Math Opns Res 21: 100–114.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Middle East Technical University, Ankara, Turkey

    M Azizoglu, M Koksalan & S K Koksalan

  2. Purdue University, West Lafayette, IN, USA

    M Koksalan & S K Koksalan

Authors
  1. M Azizoglu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M Koksalan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S K Koksalan
    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

Azizoglu, M., Koksalan, M. & Koksalan, S. Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed. J Oper Res Soc 54, 661–664 (2003). https://doi.org/10.1057/palgrave.jors.2601478

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2601478

Keywords

Search

Navigation