×

Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times. (English) Zbl 1165.90471

Summary: We consider the single machine scheduling problem with exponential time-dependent learning effect and past-sequence-dependent (p-s-d) setup times. By the exponential time-dependent learning effect, we mean that the processing time of a job is defined by an exponent function of the total normal processing time of the already processed jobs. The setup times are proportional to the length of the already processed jobs. We consider the following objective functions: the makespan, the total completion time, the sum of the quadratic job completion times, the total weighted completion time and the maximum lateness. We show that the makespan minimization problem, the total completion time minimization problem and the sum of the quadratic job completion times minimization problem can be solved by the smallest (normal) processing time first (SPT) rule, respectively. We also show that the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time under certain conditions.

MSC:

90B35 Deterministic scheduling theory in operations research
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Badiru, A.B., Computational survey of univariate and multivariate learning curve models, IEEE transactions on engineering management, 39, 176-188, (1992)
[2] Biskup, D., Single-machine scheduling with learning considerations, European journal of operational research, 115, 173-178, (1999) · Zbl 0946.90025
[3] Cheng, T.C.E.; Wang, G., Single machine scheduling with learning effect considerations, Annals of operations research, 98, 273-290, (2000) · Zbl 0967.68019
[4] Wright, T.P., Factors affecting the cost of airplanes, Journal of the aeronautical sciences, 3, 122-128, (1936)
[5] Mosheiov, G., Scheduling problems with a learning effect, European journal of operational research, 132, 687-693, (2001) · Zbl 1017.90051
[6] Mosheiov, G., Parallel machine scheduling with a learning effect, Journal of the operational research society, 52, 1165-1169, (2001) · Zbl 1178.90159
[7] Lee, W.-C.; Wu, C.-C., Minimizing total completion time in a two-machine flowshop with a learning effect, International journal of production economics, 88, 85-93, (2004)
[8] Lee, W.-C.; Wu, C.-C.; Sung, H.-J., A bi-criterion single-machine scheduling problem with learning considerations, Acta informatica, 40, 303-315, (2004) · Zbl 1137.90500
[9] Wang, J.-B.; Xia, Z.-Q., Flow-shop scheduling with a learning effect, Journal of the operational research society, 56, 1325-1330, (2005) · Zbl 1082.90041
[10] Wang, J.-B., Flow shop scheduling jobs with position-dependent processing times, Journal of applied mathematics and computing, 18, 383-391, (2005) · Zbl 1077.90032
[11] Pegels, C.C., On startup or learning curves: an expanded view, AIIE transactions, 1, 316-322, (1969)
[12] Mosheiov, G.; Sidney, J.B., Scheduling with general job-dependent learning curves, European journal of operational research, 147, 665-670, (2003) · Zbl 1037.90529
[13] Biskup, D.; Simons, D., Common due date scheduling with autonomous and induced learning, European journal of operational research, 159, 606-616, (2004) · Zbl 1134.90378
[14] Kuo, W.-H.; Yang, D.-L., Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect, European journal of operational research, 174, 1184-1190, (2006) · Zbl 1103.90341
[15] Kuo, W.-H.; Yang, D.-L., Single-machine group scheduling with a time-dependent learning effect, Computers & operations research, 33, 2099-2112, (2006) · Zbl 1086.90025
[16] Eren, T.; Guner, E., A bicriteria scheduling with a learning effect: total completion time and total tardiness, INFOR: information systems and operational research, 45, 75-81, (2007)
[17] Eren, T.; Guner, E., Minimizing total tardiness in a scheduling problem with a learning effect, Applied mathematical modelling, 31, 1351-1361, (2007) · Zbl 1145.90021
[18] Wang, J.-B.; Ng, C.T.; Cheng, T.C.E.; Liu, L.L., Single-machine scheduling with a time-dependent learning effect, International journal of production economics, 111, 802-811, (2008)
[19] Kuolamas, C.; Kyparisis, G.J., Single-machine and two-machine flowshop scheduling with general learning functions, European journal of operational research, 178, 402-407, (2007) · Zbl 1107.90018
[20] Eren, T., A bicriteria parallel machine scheduling with a learning effect of setup and removal times, Applied mathematical modelling, (2008)
[21] Bachman, A.; Janiak, A., Scheduling jobs with position-dependent processing times, Journal of the operational research society, 55, 257-264, (2004) · Zbl 1095.90033
[22] Biskup, D., A state-of-the-art review on scheduling with learning effects, European journal of operational research, 188, 315-329, (2008) · Zbl 1129.90022
[23] Allahverdi, A.; Gupta, J.N.D.; Aldowaisan, T., A review of scheduling research involving setup considerations, Omega, 27, 219-239, (1999)
[24] Allahverdi, A.; Ng, C.T.; Cheng, T.C.E.; Kovalyov, M.Y., A survey of scheduling problems with setup times or costs, European journal of operational research, 187, 985-1032, (2008) · Zbl 1137.90474
[25] Koulamas, C.; Kyparisis, G.J., Single-machine scheduling problems with past-sequence-dependent setup times, European journal of operational research, 187, 1045-1049, (2008) · Zbl 1137.90498
[26] Kuo, W.-H.; Yang, D.-L., Single-machine scheduling with past-sequence-dependent setup and learning effects, Information processing letters, 102, 22-26, (2007) · Zbl 1184.68132
[27] Graham, R.L.; Lawler, E.L.; Lenstra, J.K.; Rinnooy Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of discrete mathematics, 5, 287-326, (1979) · Zbl 0411.90044
[28] Townsend, W., The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution, Management science, 24, 530-534, (1978) · Zbl 0371.90065
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.