Skip to main content
SpringerLink
Log in

An efficient algorithm for scheduling jobs on a machine with periodic maintenance

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

As machine maintenance is required in many industries, it is usually arranged in a planned schedule. In this paper, we discuss a scheduling problem where periodic maintenance and jobs are scheduled on a regular basis. In our research, a periodic maintenance sequence consists of several maintenance periods and each maintenance period is scheduled after a fixed time interval. The objective is to minimize the total flow time and the maximum tardiness. A heuristic that utilizes the theorem is proposed to solve the problem by providing a small set of efficient sequences. A decision-maker may choose one of the sequences according to his preference. We also propose a branch-and-bound algorithm is to find the optimal sequence. Computational results show that the presented 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

Similar content being viewed by others

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Ji M, He Y, Cheng TCE (2005) Single-machine scheduling with periodic maintenance to minimize makespan. Comput Opns Res, (In Press), Corrected proof, available online 22 August

  3. Mosheiov G (1994) Minimizing the sum of job completion times on capacitated parallel machines. Math Comput Model 20:91–99

    Article  MATH  Google Scholar 

  4. Schmidt G (1988) Scheduling independent tasks with deadlines on semi-identical processors. J Oper Res Soc 39:271–277

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Asano M, Ohta H (1999) Single-machine scheduling to meet due dates under shutdown constraints. Int J Prod Econo 60–61:537–547

    Article  Google Scholar 

  9. Savsar M, Allahverdi A (1999) Algorithms for scheduling of jobs on two serial duplicate stations. Int Trans Oper Res 6:411–422

    Article  MathSciNet  Google Scholar 

  10. Allahverdi A, Savsar M (2002) Scheduling of three serial duplicate stations in assembly lines with setups. Int J Indus Eng 9:265–274

    Google Scholar 

  11. Van Wassenhove LN, Gelders LF (1980) Solving a bicriterion scheduling problem. Eur J Oper Res 4:42–48

    Article  Google Scholar 

  12. Emmons H (1975) One machine sequencing to minimize mean flow time with minimum tardy. Nav Res Log Quarterly 22:585–592

    Article  MATH  MathSciNet  Google Scholar 

  13. Liao CJ, Chuang CH (1996) Sequencing with setup time and order tardiness trade-off. Nav Res Log 43:971–984

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. Kise H, Ibaraki T, Mine H (1979) Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. J Oper Res Soc Jpn 22:205–224

    MATH  MathSciNet  Google Scholar 

  16. Potts CN (1980). Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper Res 10:1436–1441

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Business Administration, China University of Technology, No. 530, Sec. 3, Zhongshan Rd., Hu-Kou, Hsin-Chu 303, Taiwan, Republic of China

    Wen-Jinn Chen

Authors
  1. Wen-Jinn Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wen-Jinn Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, WJ. An efficient algorithm for scheduling jobs on a machine with periodic maintenance. Int J Adv Manuf Technol 34, 1173–1182 (2007). https://doi.org/10.1007/s00170-006-0689-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0689-x

Keywords

Search

Navigation