Jens Kuhpfahl analyzes the job shop scheduling problem with minimizing the total weighted
tardiness as objective. First he provides a suitable graph representation based on a
disjunctive graph formulation. Second several key components of local search procedures are
analyzed and enhanced. The resulting outputs of these investigations contribute to the
development of a new solution procedure whose performance quality leads to superior
computational results.
