English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We study the fabric spreading and cutting problem in apparel factories. Forthe sake of saving the material costs, the cutting requirement should be metexactly without producing additional garment components. For reducing theproduction costs, the number of lays that corresponds to the frequency of usingthe cutting beds should be minimized. We propose an iterated greedy algorithmfor solving the fabric spreading and cutting problem. This algorithm contains aconstructive procedure and an improving loop. Firstly the constructiveprocedure creates a set of lays in sequence, and then the improving loop triesto pick each lay from the lay set and rearrange the remaining lays into asmaller lay set. The improving loop will run until it cannot obtain any smalllay set or the time limit is due. The experiment results on 500 cases showsthat the proposed algorithm is effective and efficient.

A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories