Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
The problem of efficiently cutting smaller two-dimensional pieces from a larger surface is recurrent in several manufacturing settings. This problem belongs to the domain of cutting and packing (C&P) problems. This study approached a category of C&P problems called the minimum time cut path...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
MDPI AG
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/20e44d3344f8454da7194fe4fad662c7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|