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

M. Duran Toksarı; Daniel Oron; Ertan Güner

RAIRO - Operations Research (2010)

  • Volume: 44, Issue: 2, page 107-118
  • ISSN: 0399-0559

Abstract

top
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.

How to cite

top

Duran Toksarı, M., Oron, Daniel, and Güner, Ertan. "Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning." RAIRO - Operations Research 44.2 (2010): 107-118. <http://eudml.org/doc/250846>.

@article{DuranToksarı2010,
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. },
author = {Duran Toksarı, M., Oron, Daniel, Güner, Ertan},
journal = {RAIRO - Operations Research},
keywords = {Scheduling; single Machine; past sequence dependent (p-s-d) setup times; time-dependent learning effect; deterioration jobs; scheduling; single machine; past sequence dependent (p-s-d) setup times},
language = {eng},
month = {4},
number = {2},
pages = {107-118},
publisher = {EDP Sciences},
title = {Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning},
url = {http://eudml.org/doc/250846},
volume = {44},
year = {2010},
}

TY - JOUR
AU - Duran Toksarı, M.
AU - Oron, Daniel
AU - Güner, Ertan
TI - Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning
JO - RAIRO - Operations Research
DA - 2010/4//
PB - EDP Sciences
VL - 44
IS - 2
SP - 107
EP - 118
AB - 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.
LA - eng
KW - Scheduling; single Machine; past sequence dependent (p-s-d) setup times; time-dependent learning effect; deterioration jobs; scheduling; single machine; past sequence dependent (p-s-d) setup times
UR - http://eudml.org/doc/250846
ER -

References

top
  1. B. Alidaee and N.K. Womer, Scheduling with time dependent processing times: Review and extensions. J. Oper. Res. Soc.50 (1999) 711–720.  Zbl1054.90542
  2. D. Biskup, Single-machine scheduling with learning considerations. European J. Oper. Res.115 (1999) 173–178.  Zbl0946.90025
  3. S. Browne and U. Yechiali, Scheduling deteriorating jobs on a single processor. Oper. Res.38 (1990) 495–498.  Zbl0703.90051
  4. T.C.E. Cheng, Q. Ding and B.M.T. Lin, A concise survey on the scheduling problems with deteriorating processing times. Eur. J. Oper. Res.152 (2003) 1–13.  Zbl1030.90023
  5. T.C.E. Cheng, Chin-Chia Wu and Wen-Chiung Lee, Some scheduling problems with deteriorating jobs and learning effects. Comp. Ind. Eng.54 (2008) 972–982.  
  6. T. Eren and E. Güner, Minimizing total tardiness in a scheduling problem with a learning effect. Appl. Math. Model.31 (2007) 1351–1361.  Zbl1145.90021
  7. J.N.D. Gupta and S.K. Gupta, Single facility scheduling with nonlinear processing times. Comput. Ind. Eng.14 (1988) 387–393.  
  8. C. Koulamas and G.J. Kyparisis, Single machine scheduling problems with past-sequence-dependent setup times. Eur. J. Oper. Res. 187 (2008) 1045–1049.  Zbl1137.90498
  9. W.H. Kuo and D.L. Yang, Single machine group scheduling with past-sequence-dependent setup times and learning effects. Inf. Process. Lett.102 (2007) 22–26.  Zbl1184.68132
  10. W.H. Kuo and D.L. Yang, Single machine group scheduling with a time dependent learning effect. Eur. J. Oper. Res.33 (2006) 2099–2112.  Zbl1086.90025
  11. W.H. Kuo and D.L. Yang, 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.  Zbl1103.90341
  12. G. Mosheiov, Scheduling problems with a learning effect. Eur. J. Oper. Res.132 (2001) 687–693.  Zbl1017.90051
  13. G. Mosheiov and J.B. Sidney, Scheduling with general job-dependent learning curves. Eur. J. Oper. Res.147 (2003) 665–670.  Zbl1037.90529
  14. 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.  Zbl1179.90158
  15. W. Townsend, The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manage. Sci.24 (1978) 530–534.  Zbl0371.90065
  16. G.T. Voutsinas and C.P. Pappis, Scheduling jobs with values exponentially deteriorating over time. Int. J. Prod. Econ.79 (2002) 163–169.  
  17. X. Wang and T.C.E. Cheng, Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur. J. Oper. Res.178 (2007) 57–70.  Zbl1110.90045
  18. J.B. Wang, Single-machine scheduling problems with the effects of learning and deterioration. Omega35 (2007) 397–402.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.