Abstract
In this note, we consider a single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. We show that even with the introduction of the proposed model to job processing times, several single-machine problems remain polynomially solvable. For the following objective functions, the discounted total weighted completion time, the maximum lateness, we present heuristics according to the corresponding problems without learning effect. We also analyze the worst-case bound of our 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
Badiru AB (1992) Computational survey of univariate and multivariate learning curve models. IEEE Trans Eng Manag 39:176–188
Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178
Cheng TCE, Wang G (2000) Single machine scheduling with learning effect considerations. Ann Oper Res 98:273–290
Wright TP (1936) Factors affecting the cost of airplanes. J Aeronaut Sci 3:122–128
Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315–329
Cheng TCE, Wu C-C, Lee W-C (2008) Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 54:972–982
Cheng TCE, Wu C-C, Lee W-C (2008) Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Inf Sci 178:2476–2487
Mosheiov G (2008) Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines. J Oper Res Soc 59:1422-1424
Cheng TCE, Lai P-J, Wu C-C, Lee W-C (2009) Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Inf Sci 179:3127–3135
Lee W-C, Wu C-C (2009) Some single-machine and m-machine flowshop scheduling problems with learning considerations. Inf Sci 179:3885–3892
Lee W-C, Wu C-C (2009) A note on single-machine group scheduling problems with position-based learning effect. Appl Math Model 33:2159–2163
Wu C-C, Lee W-C (2009) Single-machine and flowshop scheduling with a general learning effect model. Comput Ind Eng 56:1553–1558
Yang D-L, Kuo W-H (2009) Single-machine scheduling with both deterioration and learning effects. Ann Oper Res 172:315–327
Yin Y, Xu D, Sun K, Li H (2009) Some scheduling problems with general position-dependent and time-dependent learning effects. Inf Sci 179:2416–2425
Wang J-B, Wang D, Wang L-Y, Lin L, Yin N, Wang W-W (2009) Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times. Comput Math Appl 57:9–16
Yang D-L, Kuo W-H (2010) Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 58:25–28
Wang J-B, Sun L-H, Sun L-Y (2010) Single machine scheduling with a learning effect and discounted costs. Int J Adv Manuf Technol 49:1141–1149
Wang J-B, Wang M-Z (2010) Single machine multiple common due dates scheduling with general job-dependent learning curves. Comput Math Appl 60:2998–3002
Wang J-B, Wang M-Z (2011) A revision of machine scheduling problems with a general learning effect. Math Comput Model 53:330–336
Wang J-B, Li J-X (2011) Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects. Appl Math Model 35:1388–1395
Wu C-C, Yin Y, Cheng S-R (2011) Some single-machine scheduling problems with a truncation learning effect. Comput Ind Eng 60:790–795
Cheng TCE, Cheng S-R, Wu W-H, Hsu P-H, Wu C-C (2011) A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Comput Ind Eng 60:534–541
Yin N, Wang X-Y (2011) Single machine scheduling with controllable processing times and learning effect. Int J Adv Manuf Technol 54:743–748
Huang X, Wang M-Z, Wang J-B (2011) Single machine group scheduling with both learning effects and deteriorating jobs. Comput Ind Eng 60:750–754
Wu C-C, Yin Y, Wu W-H, Cheng S-R (2012) Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times based learning effect. Eur J Ind Eng 6:441–453
Wang J-B, Wang M-Z (2012) Worst-case analysis for flow shop scheduling problems with an exponential learning effect. J Oper Res Soc 63:130–137
Wang J-B, Wu Y-B, Ji P (2012) A revision of some single-machine and m-machine flowshop scheduling problems with learning considerations. Inf Sci 190:227–232
Bai J, Wang M-Z, Wang J-B (2012) Single machine scheduling with a general exponential learning effect. Appl Math Model 36:829–835
Shen P, Wei C-M, Wu Y-B (2012) A note on deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times. Int J Adv Manuf Technol 58:723–725
Wang L-Y, Feng E-M (2012) A note on single-machine scheduling problems with the effects of deterioration and learning. Int J Adv Manuf Technol 59:539–545
Wang J-B, Wang X-Y, Sun L-H, Sun L-Y (2012) Scheduling jobs with truncated exponential learning functions. Optimization Letters. doi:10.1007/s11590-011-0433-9
Wu C-C, Yin Y, Cheng S-R (2012) Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. J Oper Res Soc. doi:10.1057/jors.2012.46
Kuo W-H, Yang D-L (2006) Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur J Oper Res 174:1184–1190
Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice-Hall, Upper Saddle River
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326
Townsend W (1978) The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manag Sci 24:530–534
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, L., Yang, SW., Wu, YB. et al. Single machine scheduling jobs with a truncated sum-of-processing-times-based learning effect. Int J Adv Manuf Technol 67, 261–267 (2013). https://doi.org/10.1007/s00170-013-4772-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-013-4772-9