Single Machine Scheduling with Time-Dependent Learning Effect and Non-Linear Past-Sequence-Dependent Setup Times
Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=53571#.VMnXpSzQrzE Author(s) Yuling Yeh 1 , Chinyao Low 2 , Wen-Yi Lin 2 Affiliation(s) 1 Department of Marketing and Logistics, Nan Kai University of Technology, Nantou, Chinese Taipei . 2 Institute of Industrial Engineering and Management, National Yunlin University of Science and Technology, Douliou, Chinese Taipei . ABSTRACT This paper studies a single machine scheduling problem with time-dependent learning and setup times. Time-dependent learning means that the actual processing time of a job is a function of the sum of the normal processing times of the jobs already scheduled. The setup time of a job is proportional to the length of the already processed jobs, that is, past-sequence-dependent (psd) setup time. We show that the addressed problem remains polynomially solvable for the objectives, i.e., minimization of the total completion time and minimiza...