Object oriented modeling of resource assignment problems formulated as CSPs
- Autores
- Rueda, Luis G.; Arias, Ivanna; Ibáñez, Francisco S.; Forradellas Martinez, Raymundo Quilez
- Año de publicación
- 1997
- Idioma
- español castellano
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- Discrete combinatorial problems can be solved with Constraint Programming (CP) as long as they are formulated as Constraint Satisfaction Problems (CSP). In this paper we propose an object oriented model to solve combinatorial problems of resource assignment including applications in industry, commerce, and general organizations. Problems of these environments are those having entities that have to be assigned to places. A particular case of these problems is proposed and modeled here. This problem, named the Classroom Problem, is in a school with teachers; each teacher is to be assigned to any of the rooms of the school in different schedules and days. Besides there is a set of constraints limiting such assignment. The advantages with respect to other approaches which deal with a particular case of the problem considered in this work are identified and discussed.
Eje: Ingeniería de software. Bases de datos
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Object Oriented Modeling
Resource Assignment
CSP
SOFTWARE ENGINEERING
base de datos - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/23960
Ver los metadatos del registro completo
id |
SEDICI_95afcdc4c7980be6af9a9b28e4d917bb |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/23960 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Object oriented modeling of resource assignment problems formulated as CSPsRueda, Luis G.Arias, IvannaIbáñez, Francisco S.Forradellas Martinez, Raymundo QuilezCiencias InformáticasObject Oriented ModelingResource AssignmentCSPSOFTWARE ENGINEERINGbase de datosDiscrete combinatorial problems can be solved with Constraint Programming (CP) as long as they are formulated as Constraint Satisfaction Problems (CSP). In this paper we propose an object oriented model to solve combinatorial problems of resource assignment including applications in industry, commerce, and general organizations. Problems of these environments are those having entities that have to be assigned to places. A particular case of these problems is proposed and modeled here. This problem, named the Classroom Problem, is in a school with teachers; each teacher is to be assigned to any of the rooms of the school in different schedules and days. Besides there is a set of constraints limiting such assignment. The advantages with respect to other approaches which deal with a particular case of the problem considered in this work are identified and discussed.Eje: Ingeniería de software. Bases de datosRed de Universidades con Carreras en Informática (RedUNCI)1997info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23960spainfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:40Zoai:sedici.unlp.edu.ar:10915/23960Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:40.639SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Object oriented modeling of resource assignment problems formulated as CSPs |
title |
Object oriented modeling of resource assignment problems formulated as CSPs |
spellingShingle |
Object oriented modeling of resource assignment problems formulated as CSPs Rueda, Luis G. Ciencias Informáticas Object Oriented Modeling Resource Assignment CSP SOFTWARE ENGINEERING base de datos |
title_short |
Object oriented modeling of resource assignment problems formulated as CSPs |
title_full |
Object oriented modeling of resource assignment problems formulated as CSPs |
title_fullStr |
Object oriented modeling of resource assignment problems formulated as CSPs |
title_full_unstemmed |
Object oriented modeling of resource assignment problems formulated as CSPs |
title_sort |
Object oriented modeling of resource assignment problems formulated as CSPs |
dc.creator.none.fl_str_mv |
Rueda, Luis G. Arias, Ivanna Ibáñez, Francisco S. Forradellas Martinez, Raymundo Quilez |
author |
Rueda, Luis G. |
author_facet |
Rueda, Luis G. Arias, Ivanna Ibáñez, Francisco S. Forradellas Martinez, Raymundo Quilez |
author_role |
author |
author2 |
Arias, Ivanna Ibáñez, Francisco S. Forradellas Martinez, Raymundo Quilez |
author2_role |
author author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Object Oriented Modeling Resource Assignment CSP SOFTWARE ENGINEERING base de datos |
topic |
Ciencias Informáticas Object Oriented Modeling Resource Assignment CSP SOFTWARE ENGINEERING base de datos |
dc.description.none.fl_txt_mv |
Discrete combinatorial problems can be solved with Constraint Programming (CP) as long as they are formulated as Constraint Satisfaction Problems (CSP). In this paper we propose an object oriented model to solve combinatorial problems of resource assignment including applications in industry, commerce, and general organizations. Problems of these environments are those having entities that have to be assigned to places. A particular case of these problems is proposed and modeled here. This problem, named the Classroom Problem, is in a school with teachers; each teacher is to be assigned to any of the rooms of the school in different schedules and days. Besides there is a set of constraints limiting such assignment. The advantages with respect to other approaches which deal with a particular case of the problem considered in this work are identified and discussed. Eje: Ingeniería de software. Bases de datos Red de Universidades con Carreras en Informática (RedUNCI) |
description |
Discrete combinatorial problems can be solved with Constraint Programming (CP) as long as they are formulated as Constraint Satisfaction Problems (CSP). In this paper we propose an object oriented model to solve combinatorial problems of resource assignment including applications in industry, commerce, and general organizations. Problems of these environments are those having entities that have to be assigned to places. A particular case of these problems is proposed and modeled here. This problem, named the Classroom Problem, is in a school with teachers; each teacher is to be assigned to any of the rooms of the school in different schedules and days. Besides there is a set of constraints limiting such assignment. The advantages with respect to other approaches which deal with a particular case of the problem considered in this work are identified and discussed. |
publishDate |
1997 |
dc.date.none.fl_str_mv |
1997 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/23960 |
url |
http://sedici.unlp.edu.ar/handle/10915/23960 |
dc.language.none.fl_str_mv |
spa |
language |
spa |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1844615816186691584 |
score |
13.070432 |