| dc.creator | Ortiz Barrios, Miguel Angel | |
| dc.creator | Neira Rodado, Dionicio | |
| dc.creator | Jimenez, Genett | |
| dc.creator | Hernandez, Hugo | |
| dc.date | 2018-11-20T16:05:37Z | |
| dc.date | 2018-11-20T16:05:37Z | |
| dc.date | 2016 | |
| dc.date.accessioned | 2023-10-03T19:48:35Z | |
| dc.date.available | 2023-10-03T19:48:35Z | |
| dc.identifier | 03029743 | |
| dc.identifier | http://hdl.handle.net/11323/1435 | |
| dc.identifier | 10.1007/978-3-319-41009-8_6 | |
| dc.identifier | Corporación Universidad de la Costa | |
| dc.identifier | REDICUC - Repositorio CUC | |
| dc.identifier | https://repositorio.cuc.edu.co/ | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/9172240 | |
| dc.description | Apparel industry is characterized by the presence of flexible job-shop systems that have been structured to manufacture a wide range of customized products. However, Flexible Job-shop Scheduling is really chal-lenging and even more complex when setup times, transfer batches and multiple resources are added. In this paper, we present an application of dispatching algorithm for the Flexible Job-shop Scheduling Problem (FJSP) presented in this industry. Days of delay, throughput, earlier date and monthly demand are used as rules of operation selection. A case study in apparel industry is shown to prove the validity of the proposed framework. Results evidence that this approach outperforms the company solution and other algorithms (PGDHS and HHS/LNS) upon reducing average tardiness by 61.1%, 2.63% and 1.77% respectively. The inclusion of throughput in the model resulted in low tardiness for orders with high speed to make money. Promising directions for future research are also proposed. | |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.rights | Atribución – No comercial – Compartir igual | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject | Apparel industry | |
| dc.subject | Dispatching algorithm | |
| dc.subject | Flexible job-shop scheduling problem | |
| dc.subject | Setup times | |
| dc.subject | Throughput | |
| dc.subject | Transfer batches | |
| dc.title | Solving flexible job-shop scheduling problem with transfer batches, setup times and multiple resources in apparel industry | |
| dc.type | Capítulo - Parte de Libro | |
| dc.type | http://purl.org/coar/resource_type/c_3248 | |
| dc.type | Text | |
| dc.type | info:eu-repo/semantics/bookPart | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | http://purl.org/redcol/resource_type/CAP_LIB | |
| dc.type | info:eu-repo/semantics/acceptedVersion | |
| dc.type | http://purl.org/coar/version/c_ab4af688f83e57aa | |
