Solving flexible job-shop scheduling problem with transfer batches, setup times and multiple resources in apparel industry

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.

• Autores: Ortiz Barrios, Miguel Angel; Neira Rodado, Dionicio; Jimenez, Genett; Hernandez, Hugo
• Tipo de recurso: Part of book
• Fecha de publicación: 2016
• Institución: Corporación Universidad de la Costa
• Repositorio: REDICUC - Repositorio CUC
• Idioma: eng
• OAI Identifier: oai:repositorio.cuc.edu.co:11323/1435
• Acceso en línea: https://hdl.handle.net/11323/1435; https://repositorio.cuc.edu.co/
• Palabra clave: Apparel industry; Dispatching algorithm; Flexible job-shop scheduling problem; Setup times; Throughput; Transfer batches
• Rights: openAccess
• License: Atribución – No comercial – Compartir igual