An investigation on single machine total weighted tardiness scheduling problems

The urge to produce products in the production line at a faster rate with no compromise in quality has led to scheduling gaining greater importance in the modern day industries. Scheduling is concerned with the allocation of limited resources to tasks over time. The investigations on various scheduling problems have been of constant interest to researchers worldwide. This paper deals with an investigation on the total weighted tardiness of the single machine scheduling problems. The problems are solved by a heuristic procedure, namely backward forward heuristics. The different methods of formulating the problem instances are discussed. The benchmark problems and their best known values available in the OR library are used for the comparison to find out the influence of Relative Due Date (RDD) and Tardiness Factor (TF) used to generate the problem instances.