We describe a Prolog program for solving a problem occurring in the clothing industry. The input of the problem is a clothing "order," consisting of a number of requested garments for each size. The output is a decomposition of the given order into "lays," producing exactly the requested number of garments per size. We wish to minimize both the fabric and the labor costs. For each lay we are only interested in knowing how many copies of the set of pieces of each size are to be placed (we do not deal with the geometrical problem of placing such pieces). Computing an optimal decomposition can be viewed as a generalization of the bin-packing problem.Our system uses an enumerative, branch-and-bound method to traverse a search space. This approach resulted practical only for orders with up to seven sizes. However, since most of the orders in the firm where we found this problem have exactly this number of sizes, our system is useful in spite of having this limitation.
End of preview. The entire article is 7 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/a-prolog-program-for-decomposing-clothing-orders-into-lays-WBy51NmV0B
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
A prolog program for decomposing clothing orders into lays
Rosenblueth, David A.
Follow ACM SIGAPP Applied Computing Review
, Volume 6 (1)
Association for Computing Machinery – Apr 1, 1998
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
