Set of PLSV instances generated based on the real data about the pipe laying support vessel (PLSV) scheduling problem. We model the problem as an identical parallel machine scheduling problem with non-anticipatory family setup times. The problem consists of scheduling a set of operations on a set of machines, representing the vessels, respecting capacity, and eligibility constraints. The operations are the connections to be executed on sub-sea oil wells, allowing the production to flow to surface platforms. The wells are represented by jobs, and to be completed, all operations associated with it must be finished. The processing time of operations is fixed and not machine-dependent. One operation may be associated with several jobs simultaneously, creating intersections between operations subsets. The objective is to minimize the total weighted completion time of jobs, where the weight of a job represents its production level. Thus, the objective aims to anticipate the completion of wells with higher production levels. The material contains 72 instances with different problem characteristics and a number of operations and machines.