## Abstract

This paper presents a new model and an efficient solution algorithm for a bi-objective one-dimensional trim-loss problem. In the trim-loss - or cutting-stock - problem, customer orders of different smaller item sizes are satisfied by cutting a number of larger standard-size objects. After cutting larger objects to satisfy orders for smaller items, the remaining parts are considered as useless or wasted material, which is called "trim-loss". The two objectives of the proposed model, in the order of priority, are to minimize: the total trim loss, and the number of partially-cut large objects. To produce near-optimum solutions, a two-stage least-loss algorithm (LLA) is used to determine the combinations of small item sizes that minimize the trim loss quantity. Solving several benchmark problems from the literature, the algorithm demonstrated considerable effectiveness in terms of both objectives, in addition to high computational efficiency.

Original language | English |
---|---|

Title of host publication | 7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017 |

Publisher | IEOM Society |

Pages | 2118-2122 |

Number of pages | 5 |

ISBN (Print) | 9780985549763 |

State | Published - 2017 |

### Publication series

Name | Proceedings of the International Conference on Industrial Engineering and Operations Management |
---|---|

ISSN (Electronic) | 2169-8767 |

### Bibliographical note

Publisher Copyright:© IEOM Society International.

## Keywords

- Heuristic algorithms
- Multiple-objective optimization models
- One-dimensional cutting-stock problem
- Trim-loss problem

## ASJC Scopus subject areas

- Strategy and Management
- Management Science and Operations Research
- Control and Systems Engineering
- Industrial and Manufacturing Engineering