We study methods for the exact solution of unrelated parallel machine problem with makespan minimization, generally denoted as R||C max . Our original application arises from automotive assembly process where tasks needs to be distributed among several robots. This involves solutions instances, which proved hard a MILP solver since objective induces weak LP relaxation bounds. To improve these b...

We consider the problem of scheduling n jobs with identical processing times and given release as well delivery on m uniform machines. The goal is to minimize makespan, i.e., maximum full completion time any job. This well-known have an open complexity status even if number fixed. present a polynomial-time algorithm for which based earlier introduced algorithmic framework blesscmore (“branch le...

Loops are the main source of parallelism in scientific programs. Hence, several techniques were developed to detect parallelism in these loops and transform them into parallel forms. In this dissertation, compile time transformations and efficient parallel execution of loops with various type of dependencies are investigated. First, Doacross loops with uniform dependencies are considered for ex...