Show simple item record

dc.creatorOrtiz Barrios, Miguel Angel
dc.creatorNeira Rodado, Dionicio
dc.creatorJimenez, Genett
dc.creatorHernandez, Hugo
dc.date.accessioned2018-11-20T16:05:37Z
dc.date.available2018-11-20T16:05:37Z
dc.date.issued2016
dc.identifier.issn03029743
dc.identifier.urihttp://hdl.handle.net/11323/1435
dc.description.abstractApparel 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.spa
dc.language.isoengeng
dc.rightsAtribución – No comercial – Compartir igualeng
dc.subjectApparel industryeng
dc.subjectDispatching algorithmeng
dc.subjectFlexible job-shop scheduling problemeng
dc.subjectSetup timeseng
dc.subjectThroughputeng
dc.subjectTransfer batcheseng
dc.titleSolving flexible job-shop scheduling problem with transfer batches, setup times and multiple resources in apparel industryeng
dc.typeBook chaptereng
dc.identifier.doi10.1007/978-3-319-41009-8_6


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record