Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-10T23:18:26.586Z Has data issue: false hasContentIssue false
  • English
  • Français

Some scheduling problems with past sequence dependent setup timesunder the effects of nonlinear deterioration and time-dependent learning

Published online by Cambridge University Press:  27 April 2010

M. Duran Toksarı ,
Daniel Oron  and
Ertan Güner
M. Duran Toksarı
Affiliation:
Erciyes University, Engineering Faculty, Industrial Engineering Department, Kayseri, Turkey; dtoksari@erciyes.edu.tr
Daniel Oron
Affiliation:
Econometrics and Business Statistics, The University of Sydney, NSW 2006, Australia.
Ertan Güner
Affiliation:
Gazi University, Engineering and Architecture Faculty, Industrial Engineering Department, Ankara, Turkey.
Get access

Abstract

This paper studies scheduling problems which include a combination of nonlinear job deterioration and a time-dependent learning effect. We use past sequence dependent (p-s-d) setup times, which is first introduced by Koulamas and Kyparisis [Eur. J. Oper. Res.187 (2008) 1045–1049]. They considered a new form of setup times which depend on all already scheduled jobs from the current batch. Job deterioration and learning co-exist in various real life scheduling settings. By the effects of learning and deterioration, we mean that the processing time of a job is defined by increasing function of its execution start time and a function of the total normal processing time of jobs scheduled prior to it. The following objectives are considered: single machine makespan and sum of completion times (square) and the maximum lateness. For the single-machine case, we derive polynomial-time optimal solutions.

Keywords

Schedulingsingle Machinepast sequence dependent (p-s-d) setup timestime-dependent learning effectdeterioration jobs
Type
Research Article
Information
RAIRO - Operations Research , Volume 44 , Issue 2 , April 2010 , pp. 107 - 118
Copyright
© EDP Sciences, ROADEF, SMAI, 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Alidaee, B. and Womer, N.K., Scheduling with time dependent processing times: Review and extensions. J. Oper. Res. Soc. 50 (1999) 711–720. CrossRef
Biskup, D., Single-machine scheduling with learning considerations. European J. Oper. Res. 115 (1999) 173–178. CrossRef
Browne, S. and Yechiali, U., Scheduling deteriorating jobs on a single processor. Oper. Res. 38 (1990) 495–498. CrossRef
Cheng, T.C.E., Ding, Q. and Lin, B.M.T., A concise survey on the scheduling problems with deteriorating processing times. Eur. J. Oper. Res. 152 (2003) 1–13. CrossRef
Cheng, T.C.E., Chin-Chia Wu and Wen-Chiung Lee, Some scheduling problems with deteriorating jobs and learning effects. Comp. Ind. Eng. 54 (2008) 972–982. CrossRef
Eren, T. and Güner, E., Minimizing total tardiness in a scheduling problem with a learning effect. Appl. Math. Model. 31 (2007) 1351–1361. CrossRef
Gupta, J.N.D. and Gupta, S.K., Single facility scheduling with nonlinear processing times. Comput. Ind. Eng. 14 (1988) 387–393. CrossRef
Koulamas, C. and Kyparisis, G.J., Single machine scheduling problems with past-sequence-dependent setup times. Eur. J. Oper. Res. 187 (2008) 1045–1049. CrossRef
Kuo, W.H. and Yang, D.L., Single machine group scheduling with past-sequence-dependent setup times and learning effects. Inf. Process. Lett. 102 (2007) 22–26. CrossRef
Kuo, W.H. and Yang, D.L., Single machine group scheduling with a time dependent learning effect. Eur. J. Oper. Res. 33 (2006) 2099–2112.
Kuo, W.H. and 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 (2006) 1184–1190. CrossRef
Mosheiov, G., Scheduling problems with a learning effect. Eur. J. Oper. Res. 132 (2001) 687–693. CrossRef
Mosheiov, G. and Sidney, J.B., Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147 (2003) 665–670. CrossRef
M.D. Toksari and E. Guner, Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Adv. Manuf. Technol. in press.
Townsend, W., The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manage. Sci. 24 (1978) 530–534. CrossRef
Voutsinas, G.T. and Pappis, C.P., Scheduling jobs with values exponentially deteriorating over time. Int. J. Prod. Econ. 79 (2002) 163–169. CrossRef
Wang, X. and Cheng, T.C.E., Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur. J. Oper. Res. 178 (2007) 57–70. CrossRef
Wang, J.B., Single-machine scheduling problems with the effects of learning and deterioration. Omega 35 (2007) 397–402. CrossRef