International Journal of Advanced Manufacturing Technolog
Abstract: This paper investigates a single-machine problem in which processing times of jobs are start time dependent and the aim is to minimize the total weighted completion time. Recent research has shown the complexity of this problem to be NP-hard; however, no optimal or heuristic algorithms have been proposed. In this paper, we explore the exact solution and propose several heuristic algorithms derived based on the impacts of model parameters. The effects of normal processing times and deterioration rates are also studied.