Abstract
We consider single machine scheduling problems in which the processing time of a job depends on its position in a processing sequence. The objectives are to minimize the weighted sum of completion times, to minimize the maximum lateness and to minimize the number of tardy jobs. For some special cases, we prove that the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and Moore’s algorithm can construct an optimal sequence for these objective functions, respectively. For the general cases, we also give the worst-case bound of these three rules.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bachman, A., Janiak, A.: Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 55, 257–264 (2004)
Badiru, A.B.: Computational survey of univariate and multivariate learning curve models. IEEE Trans. Eng. Manag. 39, 176–188 (1992)
Biskup, D.: Single-machine scheduling with learning considerations. Eur. J. Oper. Res. 115, 173–178 (1999)
Biskup, D., Simons, D.: Common due date scheduling with autonomous and induced learning. Eur. J. Oper. Res. 159, 606–616 (2004)
Cheng, T.C.E., Wang, G.: Single machine scheduling with learning effect considerations. Ann. Oper. Res. 98, 273–290 (2000)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)
Lee, W.-C., Wu, C.-C., Sung, H.J.: A bi-criterion single-machine scheduling problem with learning considerations. Acta Inf. 40, 303–315 (2004)
Liu, J., Sun, S., He, L.: Some single machine scheduling problems with learning effect under consistent condition. OR Trans. 7, 21–28 (2003)
Moore, J.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag. Sci. 15, 102–109 (1968)
Mosheiov, G.: Scheduling problems with a learning effect. Eur. J. Oper. Res. 132, 687–693 (2001)
Mosheiov, G.: Parallel machine scheduling with a learning effect. J. Oper. Res. Soc. 52, 1165–1169 (2001)
Mosheiov, G., Sidney, J.B.: Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147, 665–670 (2003)
Mosheiov, G., Sidney, J.B.: Note on scheduling with general learning curves to minimize the number of tardy jobs. J. Oper. Res. Soc. 56, 110–112 (2005)
Wang, J.-B.: Flow shop scheduling jobs with position-dependent processing times. J. Appl. Math. Comput. 18, 383–391 (2005)
Wang, J.-B.: A note on scheduling problems with learning effect and deteriorating jobs. Int. J. Syst. Sci. 37, 827–833 (2006)
Wang, J.-B.: Single-machine scheduling problems with the effects of learning and deterioration. Omega Int. J. Manag. Sci. 35, 397–402 (2007)
Wang, J.-B., Lin, L., Shan, F.: Flow shop scheduling with effects of learning and deterioration. J. Appl. Math. Comput. 26, 367–379 (2008)
Wang, J.-B., Wang, M.-Z., Xia, Z.-Q.: Single-machine scheduling with a general learning effect. J. Math. Res. Expo. 25, 642–646 (2005)
Wang, J.-B., Xia, Z.-Q.: Flow-shop scheduling with a learning effect. J. Oper. Res. Soc. 56, 1325–1330 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, JB., Wang, LY., Wang, D. et al. Single machine scheduling problems with position-dependent processing times. J. Appl. Math. Comput. 30, 293–304 (2009). https://doi.org/10.1007/s12190-008-0173-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-008-0173-x