Skip to main content
SpringerLink
Log in

Minimizing total flow time in the single-machine scheduling problem with periodic maintenance

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

This paper deals with a single-machine scheduling problem with limited machine availability. The limited availability of machine results from periodic maintenance activities. In our research, a periodic maintenance schedule consists of several maintenance periods. Each maintenance period is scheduled after a periodic time interval. The objective is to find a schedule that minimizes the total flow time subject to periodic maintenance and nonresumable jobs. Some important theorems are proved for the problem. A branch-and-bound algorithm that utilizes several theorems is proposed to find the optimal schedule. We also develop a heuristic to solve large sized problems. In this paper, computational results show that the proposed heuristic is highly accurate and efficient.

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

Figure 1

Similar content being viewed by others

References

  • Adiri I, Frostig E and Rinnooy Kan AHG (1991). Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Nav Res Log 38: 261–271.

    Article  Google Scholar 

  • Allahverdi A (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Comput Opns Res 23: 909–916.

    Article  Google Scholar 

  • Allahverdi A and Mittenthal J (1998). Dual criteria scheduling on a two-machine flowshop subject to random breakdowns. Int Trans Opl Res 5: 317–324.

    Article  Google Scholar 

  • Knodel W (1981). A bin packing algorithm with complexity O(n log n) in the stochastic limit. Math Foundations Comput Sci 118: 369–378.

    Google Scholar 

  • Lee CY (1991). Parallel machines scheduling with non-simultaneous machine available time. Discrete Appl Math 30: 53–61.

    Article  Google Scholar 

  • Lee CY (1996). Machine scheduling with an availability constraint. J Global Optim 9: 395–416.

    Article  Google Scholar 

  • Lee CY (1997). Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Oper Res Lett 20: 129–139.

    Article  Google Scholar 

  • Lee CY and Liman SD (1992). Single machine flow-time scheduling with scheduled maintenance. Acta Inform 29: 375–382.

    Article  Google Scholar 

  • Lee CY and Lin CS (2001). Single-machine scheduling with maintenance and repair rate-modifying activities. Eur J Opl Res 135: 493–513.

    Article  Google Scholar 

  • Liao CJ and Chen WJ (2003). Single-machine scheduling with periodic maintenance and nonresumable jobs. Comput Open Res 30: 1335–1347.

    Article  Google Scholar 

  • Qi X, Chen T and Tu F (1999). Scheduling the maintenance on a single machine. J Opl Res Soc 50: 1071–1078.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chung Kuo Institute of Technology, Hsin-Chu, Taiwan

    W J Chen

Authors
  1. W J Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to W J Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, W. Minimizing total flow time in the single-machine scheduling problem with periodic maintenance. J Oper Res Soc 57, 410–415 (2006). https://doi.org/10.1057/palgrave.jors.2601998

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation