Ankara : The Department of Industrial Engineering and the Graduate School of Engineering and Science of Bilkent University, 2013.Thesis (Master's) -- Bilkent University, 2013.Includes bibliographical references leaves 91-96.This study considers a scheduling problem with position-dependent deteriorating jobs
and a maintenance activity in a single machine. Even in the absence of maintenance activity
and deterioration problem is NP-hard. A solution comprises the following: (i) positions of
jobs, (ii) the position of the maintenance activity, (iii) starting time of the first job in the
schedule. After the maintenance activity, machine will revert to its initial condition and
deterioration will start anew. The objective is to minimize the total weighted earliness and
tardiness costs. Jobs scheduled before (after) the due-date are penalized according to their
earliness (tardiness) value. Polynomial (O(n log n)) time solutions are provided for some
special cases. No polynomial solution exists for instances with tight due-dates. We propose a
mixed integer programming model and efficient algorithms for the cases where mathematical
formulation is not efficient in terms of computational time requirements. Computational
results show that the proposed algorithms perform well in terms of both solution quality and
computation time.Şirvan, FatmaM.S
