Abstract
The majority of the previous works concerning scheduling problems with learning effects employed several complicated lemmas to prove the polynomial solvable properties of their models. To simplify these proofs, this paper proposes a simpler technique based on the famous Lagrange mean value theorem and the common adding-and-subtracting-terms operation in mathematics. The re-argumentation of known properties for a general model and the exploitation of a new property verify the effectiveness of this proposed technique and exhibit its simplicity. Moreover, the proof technique is applicable to other similar problems because the technique requires only the prerequisites of the Lagrange mean value theorem.
Similar content being viewed by others
References
Bachman, A., Janiak, A.: Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 55(3), 257–264 (2004)
Biskup, D.: Single-machine scheduling with learning considerations. Eur. J. Oper. Res. 115(1), 173–178 (1999)
Biskup, D.: A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 188(2), 315–329 (2008)
Cheng, T.C.E., Lai, P.J., Wu, C.C., Lee, W.C.: Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Inform. Sci. 179(18), 3127–3135 (2009)
Cheng, T.C.E., Wu, C.C., Lee, W.C.: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Inform. Sci. 178(11), 2476–2487 (2008)
Koulamas, C., Kyparisis, G.J.: Single-machine and two-machine flowshop scheduling with general learning functions. Eur. J. Oper. Res. 178(2), 402–407 (2007)
Kuo, W.H., Yang, D.L.: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur. J. Oper. Res. 174(2), 1184–1190 (2006)
Lai, P.J., Lee, W.C.: Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects. Omega. 39(5), 467–471 (2011)
Lee, W.C., Lai, P.J.: Scheduling problems with general effects of deterioration and learning. Inform. Sci. 181(6), 1164–1170 (2011)
Low, C., Lin, W.Y.: Some scheduling problems with time-dependent learning effect and deteriorating jobs. Appl. Math. Model. (2013)
Lu, Y.Y., Wang, J.B.: Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times. Appl. Math. Model. (2013)
Mosheiov, G., Sidney, J.B.: Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147(3), 665–670 (2003)
Wang, J.B.: Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect. Comput. Ind. Eng. 55(3), 584–591 (2008)
Wang, J.B., Wang, J.J.: Scheduling jobs with a general learning effect model. Appl. Math. Model. 37(4), 2364–2373 (2013)
Wang, J.B., Wang, M.Z.: A revision of machine scheduling problems with a general learning effect. Math. Comput. Model. 53(1), 330–336 (2011)
Wu, C.C., Lee, W.C.: Single-machine scheduling problems with a learning effect. Appl. Math. Model. 32(7), 1191–1197 (2008)
Yang, D.L., Cheng, T., Kuo, W.H.: Scheduling with a general learning effect. Int. J. Adv. Manuf. Technol. pp. 1–13 (2013)
Yang, D.L., Kuo, W.H.: Single-machine scheduling with an actual time-dependent learning effect. J. Oper. Res. Soc. 58(10), 1348–1353 (2007)
Yin, Y., Xu, D., Sun, K., Li, H.: Some scheduling problems with general position-dependent and time-dependent learning effects. Inform. Sci. 179(14), 2416–2425 (2009)
Yin, Y., Xu, D., Wang, J.: Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect. Appl. Math. Model. 34(11), 3623–3630 (2010)
Acknowledgments
The authors would like to thank anonymous reviewers for their helpful comments. This work was supported by the National Natural Science Foundation of China under grant 71101003, 91224007 and 7133200312, and the Key Laboratory of Satellite Mapping Technology and Application, National Administration of Surveying, Mapping and Geo-information.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix A: The lemmas used by the majority of papers in scheduling with learning effects
The following lemmas are derived from [19]. However, the lemmas used by other related papers are identical or similar.
Lemma 4.1
(Lemma 2.2 in [19]) If \(f:[0, +\infty ) \mapsto (0, 1]\) is a differentiable non-increasing function and its derivative \(f'\) is non-decreasing over \([0, +\infty )\), then \((1-\alpha )f(a) + \alpha \lambda f(a+t) - \lambda f(a+ \alpha t) \leqslant 0\) for \(\alpha \geqslant 1, 0 < \lambda \leqslant 1, a \geqslant 0\) and \(t \geqslant 0\).
Proof
Define a function \(F(t)=(1-\alpha )f(a) + \alpha \lambda f(a+t) - \lambda f(a+ \alpha t)\), then take its first derivative.
Since \(\alpha \geqslant 1, t \geqslant 0\) and \(f'\) is non-decreasing, \(f'(a+t)-f'(a+\alpha t) \leqslant 0\), i.e., \(F'(t) \leqslant 0\). This implies that \(F(t)\) is non-increasing over \([0, +\infty )\). Thus, for \(\alpha \geqslant 1, 0 < \lambda \leqslant 1\) and \(a \geqslant 0\),
This completes the proof. \(\square \)
Lemma 4.2
(Lemma 2.3 in [19]) If \(f:[0, + \infty ) \mapsto (0, 1]\) is a differentiable non-increasing function and its derivative \(f'\) is non-decreasing over \([0, +\infty )\), then \(f(a) + \lambda {\lambda _2} tf'(a + t) - \lambda {\lambda _1}f(a + t) \geqslant 0\) for \(0 < \lambda \leqslant 1, 0 \leqslant {\lambda _1} \leqslant {\lambda _2} \leqslant 1, a \geqslant 0\) and \(t \geqslant 0\).
Proof
Define a function \(F(\lambda _1,\lambda _2, t)=f(a) + \lambda {\lambda _2} tf'(a + t) - \lambda {\lambda _1}f(a + t)\), then \(\frac{\partial F}{\partial \lambda _1}=-\lambda f(a+t) \leqslant 0\), \(\frac{\partial F}{\partial \lambda _2}=\lambda tf'(a+t) \leqslant 0\). Thus, for \(0 < \lambda \leqslant 1, 0 \leqslant {\lambda _1} \leqslant {\lambda _2} \leqslant 1\) and \(a \geqslant 0\),
By Lagrange mean value theorem, \(\exists \xi \in (a, a+t)\), s.t., \(f(a+t)-f(t)=f'(\xi )t\). Because of \(0 < \lambda \leqslant 1, t \geqslant 0\) and \(f'\) is non-decreasing,
This completes the proof. \(\square \)
Lemma 4.3
(Lemma 2.4 in [19]) If \(f:[0, + \infty ) \mapsto (0, 1]\) is a differentiable non-increasing function and its derivative \(f'\) is non-decreasing over \([0, + \infty )\), then \((\alpha - 1)f(a) + \lambda {\lambda _2}f(a + \alpha t) - \alpha \lambda {\lambda _1}f(a + t) \geqslant 0\) for \(\alpha \geqslant 1, 0 < \lambda \leqslant 1, 0 \leqslant {\lambda _1} \leqslant {\lambda _2} \leqslant 1,a \geqslant 0\) and \(t \geqslant 0\).
Proof
Define a function \(F(\alpha )=(\alpha - 1)f(a) + \lambda {\lambda _2}f(a + \alpha t) - \alpha \lambda {\lambda _1}f(a + t)\), then
By the second lemma above, \(F'(\alpha ) \geqslant F'(1)=f(a)+\lambda {\lambda _2}f'(a + t)-\lambda {\lambda _1}f(a + t) \geqslant 0\). This implies that \(F(\alpha )\) is non-decreasing. Thus, for \(0 < \lambda \leqslant 1, 0 \leqslant {\lambda _1} \leqslant {\lambda _2} \leqslant 1\) and \(a \geqslant 0\), we have
This completes the proof. \(\square \)
Appendix B: Two examples together used the Lagrange mean value theorem and the adding-and-subtracting-terms operation
Example 1
If a continuous function is differentiable on an open interval but unbounded, then its first derivative is also unbounded.
Proof
Let \(f(x)\) be a differentiable and unbounded function on \((a,\,b)\). Fix a point \(t \in (a,\,b)\). By the Lagrange mean value theorem, \(\forall x \in (a,\,b)\), \(x \ne t\), there exists a point \(\xi \) between \(x\) and \(t\) such that \(f(x)-f(t)=f'(\xi )(x-t)\).
Assume that \(f'(x)\) is bounded, i.e., \(\exists N>0\) such that \(|f'(x)|<N\).
The inequality Eq. (4) indicates that function \(f\) is bounded at point \(x\). Since \(x\) is an arbitrary point on the open interval \((a,b)\), \(f(x)\) is bounded on \((a,\,b)\). This leads to a contradiction with the known condition: its unboundedness. \(\square \)
Example 2
The second derivative of function \(f(x)\) is negative on \([b,\, \infty )\). If \(f(b)>0\) and \(f'(b)<0\), then equation \(f(x)=0\) has a single root on \((b,\, \infty )\).
Proof
\(f'(x)<f'(b)<0\) because of \(f''(x)<0\). By the Lagrange mean value theorem, we have
\(\mathop {\lim }\limits _{x \rightarrow \infty }{f(x)} \leqslant \mathop {\lim }\limits _{x \rightarrow \infty }{f'(b)(x-b)+f(b)} = - \infty \), thus \(\mathop {\lim }\limits _{x \rightarrow \infty }{f(x)}=- \infty \). Note \(f(b)>0\). By the intermediate value theorem, \(\exists x_0 \in (b, \, \infty )\) such that \(f(x_0)=0\).
Assume that there is another point \(x_1 \in (b, \, \infty )\), \(x_1 \ne x_0\), such that \(f(x_1)=0\). By the Lagrange mean value theorem, there is a point \(\zeta \) between \(x_0\) and \(x_1\) such that \(f'(\zeta )=0\). This contradicts with \(f'(x)<0\) at \([b,\, \infty )\). Hence, equation \(f(x)=0\) has a single root on \((b,\, \infty )\). \(\square \)
Rights and permissions
About this article
Cite this article
Luo, K., Zhang, X. A simple proof technique for scheduling models with learning effects. Optim Lett 9, 1411–1420 (2015). https://doi.org/10.1007/s11590-015-0870-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-015-0870-y