Full Text:   <2710>

CLC number: O223

On-line Access: 

Received: 2005-06-25

Revision Accepted: 2005-10-06

Crosschecked: 0000-00-00

Cited: 0

Clicked: 5464

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE A 2006 Vol.7 No.4 P.597-601


The single-machine scheduling problems with deteriorating jobs and learning effect

Author(s):  Cheng Ming-bao, Sun Shi-jie

Affiliation(s):  Department of Mathematics, Shanghai University, Shanghai 200444, China

Corresponding email(s):   chengmb99@hotmail.com, sunsj@staff.shu.edu.cn

Key Words:  Scheduling, Single-machine, Learning effect, Deteriorating jobs

Cheng Ming-bao, Sun Shi-jie. The single-machine scheduling problems with deteriorating jobs and learning effect[J]. Journal of Zhejiang University Science A, 2006, 7(4): 597-601.

@article{title="The single-machine scheduling problems with deteriorating jobs and learning effect",
author="Cheng Ming-bao, Sun Shi-jie",
journal="Journal of Zhejiang University Science A",
publisher="Zhejiang University Press & Springer",

%0 Journal Article
%T The single-machine scheduling problems with deteriorating jobs and learning effect
%A Cheng Ming-bao
%A Sun Shi-jie
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 4
%P 597-601
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.A0597

T1 - The single-machine scheduling problems with deteriorating jobs and learning effect
A1 - Cheng Ming-bao
A1 - Sun Shi-jie
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 4
SP - 597
EP - 601
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.A0597

In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimization and maximum lateness minimization corresponding to the first and second special cases of our model under some agreeable conditions. However, corresponding to the third special case of our model, we show that the optimal schedules may be different from those of the classical version for the above objective functions.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article


[1] Alidaee, B., Womer, N.K., 1999. Scheduling with time dependent processing times. Review and extension. J. Opl. Res. Soc., l50:711-720.

[2] Bachman, A., Janiak, A., 2004. Scheduling job with position-dependent processing times. J. Opl. Res. Soc., 55(3):257-264.

[3] Biskup, D., 1999. Single-machine scheduling with learning consideration. Eur. J. Opl. Res., 115:173-178.

[4] Cheng, T.C.E., Ding, Q., Lin, B.M.T., 2004. A concise survey of scheduling with time-dependent processing times. Eur. J. Opl. Res., 152(1):1-13.

[5] Lee, W.C., 2004. A note on deteriorating jobs and learning in single-machine scheduling problems. Int. J. Business and Economics, 1:83-89.

[6] Mosheiov, G., 1992. V-shaped policies to schedule deteriorating jobs. Operations Res., 39(6):979-991.

[7] Mosheiov, G., 1994. Scheduling job under simple linear deterioration. Computers & Oper. Res., 21(6):653-659.

[8] Mosheiov, G., 2001. Scheduling problems with a learning effect. Eur. J. Opl. Res., 132(3):687-693.

[9] Mosheiov, G., Sidney, J.B., 2003. Scheduling with general job-dependent learning curves. Eur. J. Opl. Res., 147(3):665-670.

Open peer comments: Debate/Discuss/Question/Opinion


Please provide your name, email address and a comment

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2024 Journal of Zhejiang University-SCIENCE