Cutting Stock Problem with the IoT

Xinbao Liu, Jun Pei, Lin Liu, Hao Cheng, Mi Zhou and Panos M. Pardalos
Additional contact information
Xinbao Liu: Hefei University of Technology
Jun Pei: Hefei University of Technology
Lin Liu: Hefei University of Technology
Hao Cheng: Hefei University of Technology
Mi Zhou: Hefei University of Technology
Panos M. Pardalos: University of Florida

Chapter Chapter 5 in Optimization and Management in Manufacturing Engineering, 2017, pp 127-161 from Springer

Abstract: Abstract The cutting stock problem is representative of the combinatorial optimization problems that arise in industries such as steel, furniture, paper, glass, and leather. In a cutting plan, we must obtain the required set of smaller pieces (items) by cutting large pieces (objects) that are in stock. The objective is usually to minimize waste. In a real-life cutting process, there are some further criteria, e.g., the number of different cutting patterns (setups), capacity of the cutting equipment, and due dates. With the increasing scarcity of resources in the world, researchers are paying more attention to resource utilization.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-64568-1_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319645681

DOI: 10.1007/978-3-319-64568-1_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().