Skip to main content
SpringerLink
Log in

An approximation algorithm for parallel machine scheduling with simple linear deterioration

  • Published:
Journal of Shanghai University (English Edition)

Abstract

In this paper, a parallel machine scheduling problem was considered, where the processing time of a job is a simple linear function of its starting time. The objective is to minimize makespan. A fully polynomial time approximation scheme for the problem of scheduling n deteriorating jobs on two identical machines was worked out. Furthermore, the result was generalized to the case of a fixed number of machines.

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. Browne S, Yechiali U. Scheduling deteriorating jobs on a single processor [J]. Operations Research, 1990, 38(3): 495–498.

    Article  MATH  Google Scholar 

  2. Kubiak W, van de Velde S L. Scheduling deteriorating jobs to minimize makespan [J]. Naval Research Logistics, 1998, 45(5): 511–523.

    Article  MATH  MathSciNet  Google Scholar 

  3. Cheng T C E, Kang L, Ng C T. Due-date assignment and single machine scheduling with deteriorating jobs [J]. Journal of the Operational Research Society, 2004, 55(2): 198–203.

    Article  MATH  Google Scholar 

  4. Bachman A, Janiak A. Minimizing maximum lateness under linear deterioration [J]. European Journal of Operational Research, 2000, 126(3): 557–566.

    Article  MATH  MathSciNet  Google Scholar 

  5. Graham R L, Lawler E L, Lenstra J K, Rinnooy Kan A H G. Optimization and approximation in deterministic sequencing and scheduling: a survey [J]. Annals of Discrete Mathematics, 1979, 5: 287–326.

    Article  MATH  MathSciNet  Google Scholar 

  6. Mosheiov G. ∧-shaped polices for scheduling deteriorating jobs [J]. Journal of the Operational Research Society, 1996, 47(6): 1184–1191.

    Article  MATH  Google Scholar 

  7. Mosheiov G. Scheduling jobs under simple linear deterioration [J]. Computers and Operations Research, 1994, 21(6): 653–659.

    Article  MATH  Google Scholar 

  8. Mosheiov G. Multi-machine scheduling with linear deterioration [J]. Information Systems and Operational Research, 1998, 36(4): 205–214.

    Google Scholar 

  9. Chen Z L. Parallel machine scheduling with time dependent processing times [J]. Discrete Applied Mathematics, 1996, 70(1): 81–93.

    Article  MATH  MathSciNet  Google Scholar 

  10. Kovalyov M Y, Kubiak W. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs [J]. Journal of Heuristics, 1998, 3(4): 287–297.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, College of Sciences, Shanghai University, Shanghai, 200444, P. R. China

    Ren Chuan-rong  (任传荣) & Kang Li-ying PhD  (康丽英) (Prof.)

Authors
  1. Ren Chuan-rong  (任传荣)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kang Li-ying PhD  (康丽英)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kang Li-ying PhD  (康丽英).

Additional information

Project supported by the National Natural Science Foundation of China (Grant No.10101010)

About this article

Cite this article

Ren, Cr., Kang, Ly. An approximation algorithm for parallel machine scheduling with simple linear deterioration. J. of Shanghai Univ. 11, 351–354 (2007). https://doi.org/10.1007/s11741-007-0406-3

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11741-007-0406-3

Keywords

2000 Mathematics Subject Classification

Search

Navigation