Single Machine Scheduling with Time-Dependent Learning Effect and Non-Linear Past-Sequence-Dependent Setup TimesReport as inadecuate




Single Machine Scheduling with Time-Dependent Learning Effect and Non-Linear Past-Sequence-Dependent Setup Times - Download this document for free, or read online. Document in PDF available to download.

This paper studies a single machinescheduling problem with time-dependent learning and setup times. Time-dependentlearning means that the actual processing time of a job is a function of thesum of the normal processing times of the jobs already scheduled. The setuptime of a job is proportional to the length of the already processed jobs, thatis, past-sequence-dependent psd setup time. We show that the addressedproblem remains polynomially solvable for the objectives, i.e., minimization ofthe total completion time and minimization of the total weighted completiontime. We also show that the smallest processing time SPT rule provides theoptimum sequence for the addressed problem.

KEYWORDS

Scheduling, Time-Dependent Learning, Setup Time, Past-Sequence-Dependent, Total Completion Time

Cite this paper

Yeh, Y. , Low, C. and Lin, W. 2015 Single Machine Scheduling with Time-Dependent Learning Effect and Non-Linear Past-Sequence-Dependent Setup Times. Journal of Applied Mathematics and Physics, 3, 10-15. doi: 10.4236-jamp.2015.31002.





Author: Yuling Yeh1, Chinyao Low2, Wen-Yi Lin2

Source: http://www.scirp.org/



DOWNLOAD PDF




Related documents