How to satisfy the customer order in the clothing industry

被引：0

作者：

Elomri, A. ^{[1
]}

Morel, P. ^{[1
]}

Radhy, N.E. ^{[1
]}

机构：

[1] Faculte des Sciences Ain Chock, Casablanca, Morocco

来源：

Systems Analysis Modelling Simulation | 2000年 / 38卷 / 01期

关键词：

Algorithms - Commerce - Computational complexity - Garment manufacture - Heuristic methods - Linear programming - Nonlinear programming - Simulated annealing - Textile industry;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Given a command of garments to cut from a customer, we propose in this paper an algorithm permitting to choose the patterns to use in order to satisfy the various objectives and constraints related to this problem. Due to the complexity of this problem and the limitation of the time of resolution, the algorithm uses an heuristic technique based on a combination between a method of residues and the Simulated Annealing approach. It allows to reach the compromise between the quality of solution and the computing time. Examples using industrial data are proposed to illustrate the usefulness of the algorithm.

引用

页码：1 / 18