Skip to main content
SpringerLink
Log in

Heuristics for the identical machine scheduling problem with preventive maintenances

  • Published:
Journal of Shanghai Jiaotong University (Science) Aims and scope Submit manuscript

Abstract

In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed periodically and the objective is to minimize the makespan. In the second model, the maintenance activities are flexible and the machines’ continuous working time cannot exceed a maximum allowed time T; the objective is to minimize the total completion time of jobs. For the first problem, we propose a heuristic longest batch time (LBT) and prove that the worst case error bound of LBT is 2. For the second problem, we develop a heuristic modified smallest processing time (MSPT) based on some properties of the optimal solutions. Computational experiments show that both of the heuristics are effective and efficient compared with the results obtained by CPLEX and the other algorithms.

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. YANG S J, YANG D L. Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities [J]. Computers and Mathematics with Applications, 2010, 60(7): 2161–2169.

    Article  MathSciNet  MATH  Google Scholar 

  2. MOLAEE E, MOSLEHI G, REISI M. Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint [J]. Computers and Mathematics with Applications, 2011, 62(9): 3622–3641.

    Article  MathSciNet  MATH  Google Scholar 

  3. CUI W W, LU Z Q. Integrating production scheduling and preventive maintenance planning for a single machine [J]. Journal of Shanghai Jiaotong University, 2012, 46(12): 2009–2013 (in Chinese).

    Google Scholar 

  4. LEE C Y. Machine scheduling with an availability constraint [J]. Journal of Global Optimization, 1996, 9(3): 395–416.

    Article  MathSciNet  MATH  Google Scholar 

  5. LIAO L W, GWO J S. Parallel machine scheduling with machine availability and eligibility constraints [J]. European Journal of Operational Research, 2008, 184(2): 458–467.

    Article  MathSciNet  MATH  Google Scholar 

  6. KUBZIN M A, POTTS C N, STRUSEVICH V A. Approximation results for flow shop scheduling problems with machine availability constraints [J]. Computers & Operations Research, 2009, 36(2): 379–390.

    Article  MathSciNet  MATH  Google Scholar 

  7. HSU C J, LOW C, SU C T. A single-machine scheduling problem with maintenance activities to minimize makespan [J]. Applied Mathematics and Computation, 2010, 215(11): 3929–3935.

    Article  MathSciNet  MATH  Google Scholar 

  8. XU D H, YANG D L. Makespan minimization for two parallel machines scheduling with a periodic availability constraint: Mathematical programming model, average-case analysis, and anomalies [J]. Applied Mathematical Modelling, 2013, 37(14): 7561–7567.

    Article  MathSciNet  Google Scholar 

  9. QI X, CHEN T, TU F. Scheduling the maintenance on a single machine [J]. Journal of the Operational Research Society, 1999, 50(10): 1071–1078.

    Article  MATH  Google Scholar 

  10. CHEN J S. Scheduling of non resumable jobs and flexible maintenance activities on a single machine to minimize makespan [J]. European Journal of Operational Research, 2008, 190(1): 90–120.

    Article  MathSciNet  MATH  Google Scholar 

  11. LEE C Y, CHEN Z L. Scheduling of jobs and maintenance activities on parallel machines [J]. Naval Research Logistics, 2000, 47(2): 85–183.

    Article  MathSciNet  Google Scholar 

  12. SUN K B, LI H X. Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines [J]. International Journal of Production Economic, 2010, 124(1): 151–158.

    Article  Google Scholar 

  13. XU D H, SUN K B, LI H X. Parallel machine scheduling with almost periodic maintenance and nonpreemptive jobs to minimize makespan [J]. Computers & Operations Research, 2008, 35(4): 1344–1349.

    Article  MathSciNet  MATH  Google Scholar 

  14. JI M, HE Y, CHEN T C E. Single-machine scheduling with periodic maintenance to minimize makespan [J]. Computers & Operations Research, 2007, 34(6): 1764–1770.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Industrial Engineering, Tongji University, Shanghai, 201804, China

    Caili Jiang  (江才林) & Zhiqiang Lu  (陆志强)

  2. Department of Industrial Engineering and Logistics Management, Shanghai Jiaotong University, Shanghai, 200240, China

    Weiwei Cui  (崔维伟)

Authors
  1. Caili Jiang  (江才林)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiqiang Lu  (陆志强)
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weiwei Cui  (崔维伟)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhiqiang Lu  (陆志强).

Additional information

Foundation item: the National Natural Science Foundation of China (No. 71171130)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, C., Lu, Z. & Cui, W. Heuristics for the identical machine scheduling problem with preventive maintenances. J. Shanghai Jiaotong Univ. (Sci.) 21, 112–120 (2016). https://doi.org/10.1007/s12204-015-1690-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12204-015-1690-z

Keywords

CLC number

Search

Navigation