Empirical Transformation of Job Shop Scheduling Problem to the Hydraulic Networks Problem in a Water Distribution System

摘要

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.