Skip to Main Content
In this paper an analogy of the job shop scheduling problem to the hydraulic networks problem is presented by mapping this model of scheduling, using as a base the disjunctive graph model. The mapping carried out allows visualization of the hydraulic networks problem as an NP-complete model with constraints defined in the job shop scheduling problem. The mapping presented indicates that the hydraulic networks problem is a difficult problem to solve by using an approach with the constraints of an NP-complete problem.
Date of Conference: 22-25 Sept. 2009