A GA methodology for the scheduling of yarn-dyed textile production

Hsu, Hsi-Mei; Hsiung, Yai; Chen, Yingzhi; Wu, Muh-Cherng

doi:10.1016/j.eswa.2009.04.075

Cited by 34 publications

(23 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Once an order has been rejected, it is considered again in the next week planning, but its rejection penalty increases. For more information on scheduling problems in textile dyeing manufacture, readers are referred to the recent paper of (Hsu et al 2009). …”

Section: Description and Motivation Of Problem (P)mentioning

confidence: 99%

Metaheuristics for a scheduling problem with rejection and tardiness penalties

Thevenin

Zufferey

Widmer

2014

J Sched

View full text Add to dashboard Cite

In this paper, we consider a single-machine scheduling problem (P) inspired from manufacturing instances. A release date, a deadline, and a regular (i.e., non-decreasing) cost function are associated with each job. The problem takes into account sequence-dependent setup times and setup costs between jobs of different families. Moreover, the company has the possibility to reject some jobs/orders, in which case a penalty (abandon cost) is incurred. Therefore, the problem at hand can be viewed as an order acceptance and scheduling problem. Order acceptance problems have gained interest among the research community over the last decades, particularly in a make-to-order environment. We propose and compare a constructive heuristic, local search methods, and population-based algorithms. Tests are performed on realistic instances and show that the developed metaheuristics significantly outperform the currently available resolution methods for the same problem

show abstract

Section: Description and Motivation Of Problem (P)mentioning

confidence: 99%

Metaheuristics for a scheduling problem with rejection and tardiness penalties

Thevenin

Zufferey

Widmer

2014

J Sched

View full text Add to dashboard Cite

show abstract

“…Finalmente, se invita al lector a revisar los siguientes trabajos sobre programación en un flow shop híbrido flexible reportados en la literatura consultada, con el fin que pueda valorar la efectividad del algoritmo que se reporta en el presente artículo: Costa et al 2013, Jabbarizadeh et al (2009) y Hsu et al (2009).…”

Section: Resultados Y Discusiónunclassified

Reducción del Tiempo de Terminación en la Programación de la Producción de una Línea de Flujo Híbrida Flexible (HFS)

2015

View full text Add to dashboard Cite

Se propone un modelo de programación de la producción mediante la aplicación de una meta heurística para lograr la reducción del tiempo de terminación del último trabajo (makespan). Se eligió como objeto de estudio una empresa del sector textil y a partir de la codificación de un algoritmo genético simple se desarrolló una metodología de programación de la producción para configuraciones tipo línea de flujo (flow shop) híbrida flexible. El algoritmo arroja resultados de buena calidad con tiempos computacionales bastante razonables y con coeficientes de variación del orden de 2%, en relación a los valores del makespan. Este modelo también muestra un nivel de eficiencia comparable a otras aplicaciones encontradas en la literatura, en las cuales se utilizan algoritmos evolutivos. Se concluye que a partir de la codificación del sistema productivo y sus principales restricciones, el algoritmo genético ejecuta bien la programación de producción reduciendo el makespan.

show abstract

“…Moreover, besides MPS, there are other studies and models on the production in fashion apparel. For example, Tomastik et al [29] develop an accurate and low-order integer programming model which integrates scheduling and resource allocation for garments production; Rose and Shier [30] apply an exact enumerative approach for the cloth cut scheduling problem; Hsu et al [31] formulate a mixed integer programming model for the scheduling problem for yarn-dyed textile manufacturing and propose a genetic algorithm to solve the problem; Yeung et al [32,33] study the supply chain coordination and scheduling problem under different settings, and fast algorithms are developed to solve the complex problem; and Choi et al [34] investigate the scheduling and coordination problem of a multisuppliers, single-warehouseoperator single manufacturer supply chain. They formulate the problem as a two-machine common-due-window flow shop problem and develop two algorithms to solve the optimal scheduling and coordination problems.…”

Section: Literature On the Adoption And Performance Of Mps In The Appmentioning

confidence: 99%

Improving the Performance of Modular Production in the Apparel Assembly: A Mathematical Programming Approach

Wang¹,

Chiu

Guo

2014

Mathematical Problems in Engineering

View full text Add to dashboard Cite

We construct the mathematical models to find the optimal allocation of the module’s capacity (module members) to different assembly operations in a module for given garment assembly tasks in a modular production system. The objectives of the models are minimizing the holding cost for work in process (WIP) inventories in the module and the total deviation of the WIP inventories from their corresponding target values in the module during a specific time interval. The solutions of the models can be used as reference to achieve better allocation of the module members to different operations in a module to fulfill the given garment assembly tasks.

show abstract

A GA methodology for the scheduling of yarn-dyed textile production

Cited by 34 publications

References 20 publications

Metaheuristics for a scheduling problem with rejection and tardiness penalties

Metaheuristics for a scheduling problem with rejection and tardiness penalties

Reducción del Tiempo de Terminación en la Programación de la Producción de una Línea de Flujo Híbrida Flexible (HFS)

Improving the Performance of Modular Production in the Apparel Assembly: A Mathematical Programming Approach

Contact Info

Product

Resources

About