On Selecting and Scheduling Assembly Plans Using Constraint Programming

Valle Sevillano, Carmelo del; Márquez, Antonio A.; Martínez Gasca, Rafael; Toro Bonilla, Miguel

doi:10.1007/978-3-540-45226-3_180

Ponencia

dc.creator	Valle Sevillano, Carmelo del	es
dc.creator	Márquez, Antonio A.	es
dc.creator	Martínez Gasca, Rafael	es
dc.creator	Toro Bonilla, Miguel	es
dc.date.accessioned	2017-11-03T09:01:52Z
dc.date.available	2017-11-03T09:01:52Z
dc.date.issued	2003
dc.identifier.citation	Valle Sevillano, C.d., Márquez, A.A., Martínez Gasca, R. y Toro Bonilla, M. (2003). On Selecting and Scheduling Assembly Plans Using Constraint Programming. En KES 2003: 7th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems (1329-1336), Oxford, UK: Springer.
dc.identifier.isbn	978-3-540-40804-8	es
dc.identifier.issn	0302-9743	es
dc.identifier.uri	http://hdl.handle.net/11441/65628
dc.description.abstract	This work presents the application of Constraint Programming to the problem of selecting and sequencing assembly operations. The set of all feasible assembly plans for a single product is represented using an And/Or graph. This representation embodies some of the constraints involved in the planning problem, such as precedence of tasks, and the constraints due to the completion of a correct assembly plan. The work is focused on the selection of tasks and their optimal ordering, taking into account their execution in a generic multi-robot system. In order to include all different constraints of the problem, the And/Or graph representation is extended, so that links between nodes corresponding to assembly tasks are added, taking into account the resource constraints. The resultant problem is mapped to a Constraint Satisfaction Problem (CSP), and is solved using Constraint Programming, a powerful programming paradigm that is increasingly used to model and solve many hard real-life problems.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Springer	es
dc.relation.ispartof	KES 2003: 7th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems (2003), p 1329-1336
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	On Selecting and Scheduling Assembly Plans Using Constraint Programming	es
dc.type	info:eu-repo/semantics/conferenceObject	es
dcterms.identifier	https://ror.org/03yxnpp24
dc.type.version	info:eu-repo/semantics/submittedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.contributor.affiliation	Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos	es
dc.relation.publisherversion	https://link.springer.com/chapter/10.1007/978-3-540-45226-3_180	es
dc.identifier.doi	10.1007/978-3-540-45226-3_180	es
idus.format.extent	8	es
dc.publication.initialPage	1329	es
dc.publication.endPage	1336	es
dc.eventtitle	KES 2003: 7th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems	es
dc.eventinstitution	Oxford, UK	es
dc.relation.publicationplace	Berlin	es
dc.identifier.sisius	6535185	es

Ficheros	Tamaño	Formato	Ver	Descripción
On Selecting and Scheduling.pdf	279.8Kb	[PDF]	Ver/Abrir

Este registro aparece en las siguientes colecciones

Ponencias (Lenguajes y Sistemas Informáticos)

Mostrar el registro sencillo del ítem

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional