In this paper, we address the transporter scheduling problem of ship assembly block operations management, which can be transformed into parallel machine scheduling with sequence-dependent setup times and precedence constraints. The objective is to maximise the workload balance among...

This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing <p> Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived <p> from precedence constraints in the Asymmetric Traveling Salesman Problem with Time <p> Windows and to k-path cuts for...</p></p></p>