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.
Similar content being viewed by others
References
Kubiak W, van de Velde SL (1998) Scheduling deteriorating jobs to minimize makespan. Nav Res Logist 45:511–523
Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21(6):653–659
Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38 :495–498
Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50:711–772
Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13
Sundararaghavan PS, Kunnathur AS (1994) Single machine scheduling with start time dependent processing time: some solvable cases. Eur J Oper Res 78(3):394–403
Mosheiov G (1996) Λ-shaped policies to schedule deteriorating jobs. J Oper Res Soc 47:1184–1191
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–693
Bachman A, Janiak A, Kovalyov MY (2002) Minimizing the total weighted completion time of deteriorating jobs. Inf Process Lett 81(2):81–84
Chen JS (2005) A branch and bound for the reentrant permutation flow-shop scheduling problem. Int J Adv Manuf Technol (in press)
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–262
Gupta AK, Sivakumar AI (2005) Single machine scheduling with multiple objectives in semiconductor manufacturing. Int J Adv Manuf Technol 26:950–958
Gupta AK, Sivakumar AI (2005) Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol 27(11/12):1163–1169
Bachman A, Janiak A (2000) Minimizing maximum lateness under linear deterioration. Eur J Oper Res 126:557–566
Hsu YS, Lin BMT (2003) Minimization of maximum lateness under linear deterioration. OMEGA Int J Manage S 31:459–469
Acknowledgements
The authors are grateful to the editor and the referees, whose constructive comments have led to a substantial improvement in the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wu, CC., Lee, WC. & Shiau, YR. Minimizing the total weighted completion time on a single machine under linear deterioration. Int J Adv Manuf Technol 33, 1237–1243 (2007). https://doi.org/10.1007/s00170-006-0565-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-006-0565-8