Minimizing the total weighted completion time on a single machine under linear deterioration

ORIGINAL ARTICLE

Abstract

This paper investigates a single-machine problem in which processing times of jobs are start time dependent and the aim is to minimize the total weighted completion time. Recent research has shown the complexity of this problem to be NP-hard; however, no optimal or heuristic algorithms have been proposed. In this paper, we explore the exact solution and propose several heuristic algorithms derived based on the impacts of model parameters. The effects of normal processing times and deterioration rates are also studied.

Keywords

Scheduling Start time dependency Linear deterioration 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kubiak W, van de Velde SL (1998) Scheduling deteriorating jobs to minimize makespan. Nav Res Logist 45:511–523MATHCrossRefGoogle Scholar
  2. 2.
    Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21(6):653–659MATHCrossRefGoogle Scholar
  3. 3.
    Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38 :495–498MATHCrossRefGoogle Scholar
  4. 4.
    Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50:711–772MATHCrossRefGoogle Scholar
  5. 5.
    Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Sundararaghavan PS, Kunnathur AS (1994) Single machine scheduling with start time dependent processing time: some solvable cases. Eur J Oper Res 78(3):394–403MATHCrossRefGoogle Scholar
  7. 7.
    Mosheiov G (1996) Λ-shaped policies to schedule deteriorating jobs. J Oper Res Soc 47:1184–1191MATHCrossRefGoogle Scholar
  8. 8.
    Bachman A, Cheng TCE, Janiak A, Ng CT (2002) Scheduling start time dependent jobs to minimize the total weighted completion time. J Oper Res Soc 53(6): 688–693MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Bachman A, Janiak A, Kovalyov MY (2002) Minimizing the total weighted completion time of deteriorating jobs. Inf Process Lett 81(2):81–84MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Chen JS (2005) A branch and bound for the reentrant permutation flow-shop scheduling problem. Int J Adv Manuf Technol (in press)Google Scholar
  11. 11.
    Das SR, Canel C (2005) An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system. Int J Prod Econ 97:247–262CrossRefGoogle Scholar
  12. 12.
    Gupta AK, Sivakumar AI (2005) Single machine scheduling with multiple objectives in semiconductor manufacturing. Int J Adv Manuf Technol 26:950–958CrossRefGoogle Scholar
  13. 13.
    Gupta AK, Sivakumar AI (2005) Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol 27(11/12):1163–1169Google Scholar
  14. 14.
    Bachman A, Janiak A (2000) Minimizing maximum lateness under linear deterioration. Eur J Oper Res 126:557–566MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Hsu YS, Lin BMT (2003) Minimization of maximum lateness under linear deterioration. OMEGA Int J Manage S 31:459–469CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2006

Authors and Affiliations

  1. 1.Department of StatisticsFeng-Chia UniversityTaichungPeople’s Republic of China
  2. 2.Department of Industrial EngineeringFeng-Chia UniversityTaichungPeople’s Republic of China

Personalised recommendations