A constraint programming-based lower bounding procedure for the job shop scheduling problem | ||
| dc.conicet.organizacion | Universidad Andrés Bello | |
| dc.conicet.organizacion | Universidad de la Sabana | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca | |
| dc.conicet.organizacion | Universidad Nacional del Sur. Departamento de Ingeniería | |
| dc.conicet.organizacion | Universidad Andrés Bello | |
| dc.contributor.author | Yuraszeck, Francisco | |
| dc.contributor.author | Mejía, Gonzalo | |
| dc.contributor.author | Rossit, Daniel Alejandro | |
| dc.contributor.author | Lüer-Villagra, Armin | |
| dc.date.issued | 2025-05 | |
| dc.description.abstract | This paper presents a novel Constraint Programming (CP) approach to obtain strong lower bounds for the Job Shop Scheduling Problem (JSSP) under the makespan criterion. Our approach comprises two phases. In the first phase, a relaxation of the original problem is solved, while in the second phase, this relaxation is iteratively tightened until a time limit is reached or no better bounds are found. We tested our procedure with 80 JSSP open instances, and the results validated our approach as we were able to find 7 new lower bounds and prove optimality in one instance. | es |
| dc.description.fil | Fil: Yuraszeck, Francisco. Universidad Andrés Bello; Chile | |
| dc.description.fil | Fil: Mejía, Gonzalo. Universidad de la Sabana; Colombia | |
| dc.description.fil | Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina | |
| dc.description.fil | Fil: Lüer-Villagra, Armin. Universidad Andrés Bello; Chile | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Yuraszeck, Francisco; Mejía, Gonzalo; Rossit, Daniel Alejandro; Lüer-Villagra, Armin; A constraint programming-based lower bounding procedure for the job shop scheduling problem; Pergamon-Elsevier Science Ltd; Computers & Operations Research; 177; 5-2025; 1-15 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.issn | 0305-0548 | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/261339 | |
| dc.journal.pagination | 1-15 | es |
| dc.journal.pais | Estados Unidos | es |
| dc.journal.title | Computers & Operations Research | es |
| dc.journal.volume | 177 | es |
| dc.language.iso | eng | es |
| dc.publisher | Pergamon-Elsevier Science Ltd | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/https://linkinghub.elsevier.com/retrieve/pii/S0305054824004362 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.cor.2024.106964 | |
| dc.rights | info:eu-repo/semantics/restrictedAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | * |
| dc.subject | SCHEDULING | es |
| dc.subject | JOB SHOP | es |
| dc.subject | LOWER BOUND | es |
| dc.subject | RESOURCE-CONSTRAINED PROJET SHEDULING PROBLEM | es |
| dc.subject | CONSTRAINT PROGRAMMING | es |
| dc.subject.classification | Otras Ingenierías y Tecnologías | es |
| dc.subject.classification | Otras Ingenierías y Tecnologías | es |
| dc.subject.classification | INGENIERÍAS Y TECNOLOGÍAS | es |
| dc.title | A constraint programming-based lower bounding procedure for the job shop scheduling problem | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.8448fcc2-6a9f-4005-abf2-d01d712d235c_B.pdf
- Tamaño:
- 2.42 MB
- Formato:
- Adobe Portable Document Format