A parallel logic programming approach to job shop scheduling constraint satisfaction problems

dc.contributor.author	Puente Peinador, Jorge
dc.contributor.author	Varela Arias, José Ramiro
dc.contributor.author	Rodríguez Vela, María del Camino
dc.contributor.author	Alonso González, César Luis
dc.date.accessioned	2015-07-15T07:16:40Z
dc.date.available	2015-07-15T07:16:40Z
dc.date.issued	1998
dc.identifier.citation	AGP, 98, p. 29-41 (1998)
dc.identifier.uri	http://hdl.handle.net/10651/31964
dc.description	Congreso APPIA-GULP-PRODE'98 Joint Conference on Declarative Programming ( La Coruña. 1998)
dc.description.abstract	In this paper we put together a Parallel Logic Programming schema and a heuristic search strategy in order to solve constraint satisfaction problems. The idea is to introduce heuristic information in the construction of logic programs in order to improve the performance. The experimental results show that logic programs can be designed that exhibit parallelism, and that the use of heuristic information translates into speedup in obtaining answers	spa
dc.format.extent	p. 29-41	spa
dc.language.iso	eng	spa
dc.relation.ispartof	AGP, 98	spa
dc.rights	© J. Puente et al.
dc.title	A parallel logic programming approach to job shop scheduling constraint satisfaction problems	eng
dc.type	conference output	spa
dc.rights.accessRights	open access	spa
dc.type.hasVersion	AM