Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Cruz-Chávez, M.A. ; CIICAp, Univ. Autonoma del Estado de Morelos, Cuernavaca, Mexico ; Avila-Melgar, E.Y. ; Juárez-Pérez, F. ; Torres-Sanchez, W.G.

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.

Published in:

Electronics, Robotics and Automotive Mechanics Conference, 2009. CERMA '09.

Date of Conference:

22-25 Sept. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.