@article{article_346095, title={Minimizing the Total Completion Time and Maximum Tardiness on a Scheduling with a Learning Effect}, journal={International Journal of Engineering Research and Development}, volume={7}, pages={19–24}, year={2015}, DOI={10.29137/umagd.346095}, author={Eren, Tamer}, keywords={Scheduling,learning effect,total completion time,maximum tardiness,mathematical programming}, abstract={<p align="justify">In this study; learning effect on single machine scheduling is analyzed of total completion time and maximum tardiness is taken as a performance criteria. This study shows that Smith Algorithm [1] (minimizing total completion time subject to minimum maximum tardiness) and Van Vassenhove ve Gelder algorithm [2] (minimizing total completion time and minimize maximum tardiness simultaneously) which guarantees the best solution in classical situation (without learning effect), cannot guarantee the best results in the situation with learning effect. Mathematical programming models are developed for solving these problems. <br> </p>}, number={1}, publisher={Kirikkale University}