Abstract
This paper studies two single-machine scheduling problems with the effect of deterioration and learning. In this model, the processing times of jobs are defined as functions of their starting times and positions in a sequence. For the following two objective functions: the weighted sum of completion times and the maximum lateness, this paper proposes two heuristics according to the corresponding single machine problems without learning effect. This paper also gives the worst-case error bound for the heuristics and provides computational results to evaluate the performance of the heuristics.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50:711–720
Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13
Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315–329
Wu C-C, Lee W-C, Shiau Y-R (2007) Minimizing the total weighted completion time on a single machine under linear deterioration. Int J Adv Manuf Technol 33:1237–1243
Shiau Y-R, Lee W-C, Wu C-C, Chang C-M (2007) Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int J Adv Manuf Technol 34:774–782
Eren T, Guner E (2008) A bicriteria parallel machine scheduling with a learning effect. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1436-2
Lee W-C, Wu C-C, Liu H-C (2009) A note on single-machine makespan problem with general deteriorating function. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1421-9
Wang J-B, Wang L-Y, Wang D, Huang X, Wang X-R (2009) A note on single-machine total completion time problem with general deteriorating function. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1918-2
Lee W-C (2004) A note on deteriorating jobs and learning in single-machine scheduling problems. Int J Bus Econ 3:83–89
Wang J-B (2006) A note on scheduling problems with learning effect and deteriorating jobs. Int J Syst Sci 37:827–833
Wang J-B (2007) Single-machine scheduling problems with the effects of learning and deterioration. Omega 35:397–402
Wang J-B, Cheng TCE (2007) Scheduling problems with the effects of deterioration and learning. Asia-Pac J Oper Res 24:245–261
Wang X, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur J Oper Res 178:57–70
Toksar MD, Guner E (2007) Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int J Adv Manuf Technol. doi:10.1007/s00170-007-1128-3
Wang J-B, Huang X, Wang X-Y, Yin N, Wang L-Y (2009) Learning effect and deteriorating jobs in the single machine scheduling problems. Appl Math Model. doi:10.1016/j.apm.2009-01-004
Nembhard DA, Osothsilp N (2002) Task complexity effects on between-individual learning/forgetting variability. Int J Ind Ergon 29:297–306
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326
Zhao C, Zhang Q, Tang H (2003) Scheduling problems under linear deterioration. Acta Automatic Sinica 29:531–535
Cheng TCE, Wang G (2000) Single machine scheduling with learning effect considerations. Ann Oper Res 98:273–290
Gupta AK, Sivakumar AI (2005) Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol 27:1163–1169
Pegels C-C (1969) On start-up or learning curves: an expanded view. AIIE Trans 1:316–322
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, LY., Feng, EM. A note on single-machine scheduling problems with the effects of deterioration and learning. Int J Adv Manuf Technol 59, 539–545 (2012). https://doi.org/10.1007/s00170-011-3528-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-011-3528-7