We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Bin packing problem with restricted item fragmentation: Assignment of jobs in multi-product assembly environment with overtime.
- Authors
Ustuncelik, Mustafa; Koc, Cagri; Tun, Huseyin
- Abstract
This paper studies the assignment problem of multi product assembly jobs to days. The problem aims to minimize the amount of overtime while avoiding assembly delays for jobs that can be fragmented into smaller sub-tasks. When sequencedependent setup times are negligible, the problem considered transforms into the bin packing problem with restricted item fragmentation where jobs represent items and days stand for bins. We present a mixed integer programming model of the problem by extending earlier formulations in the literature. Computational experiments show that the mathematical model obtained optimal solutions for majority of instances tested within reasonable computation times.
- Subjects
BIN packing problem; OVERTIME; INTEGER programming; ASSIGNMENT problems (Programming); SETUP time; MATHEMATICAL models
- Publication
International Journal of Optimization & Control: Theories & Applications, 2024, Vol 14, Issue 1, p32
- ISSN
2146-0957
- Publication type
Article
- DOI
10.11121/ijocta.1435