Skip to main content
SpringerLink
Log in

Scheduling of jobs and maintenance in a textile company

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

Abstract

In this paper we consider a periodic maintenance scheduling problem in a textile company. In our research, a periodic maintenance schedule consists of several maintenance periods and each maintenance period is scheduled after a periodic time interval. The purpose of this paper is to find a schedule that minimizes the maximum tardiness subject to periodic maintenance and nonresumable jobs. An efficient heuristic is developed to provide the near optimal schedule for the problem. A branch-and-bound algorithm is also proposed to find the optimal schedule. Some important theorems associated with the problem are implemented in the algorithm. 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

Similar content being viewed by others

References

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

    Article  ADS  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Espinouse ML, Formanowicz P, Penz B (1999) Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability. Comput Ind Eng 37:497–500

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  6. Lee CY, Liman SD (1993) Capacitated two-parallel machine scheduling to minimize sum of job completion time. Discrete Appl Math 41:211–222

    Article  MathSciNet  Google Scholar 

  7. Kubiak W, Blazewicz J, Formanowicz P, Breit J, Schmidt G (2002) Two-machine flow shops with limited machine availability. Eur J Oper Res 136:528–540

    Article  MathSciNet  Google Scholar 

  8. Sanlaville E (1995) Nearly on line scheduling of preemptive independent task. Discrete Appl Math 57:229–241

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  ADS  MathSciNet  Google Scholar 

  12. Lee CY (1999) Two-machine flowshop scheduling with availability constraints. Eur J Oper Res 114:420–429

    Article  ADS  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

    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.J. Scheduling of jobs and maintenance in a textile company. Int J Adv Manuf Technol 31, 737–742 (2007). https://doi.org/10.1007/s00170-005-0253-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-005-0253-0

Keywords

Search

Navigation