Details

Autor(en) / Beteiligte

• Yang, Bokang
• Du, Wangdi
• Shi, Daosheng

Titel

Integer programming model for two-dimensional cutting problem of plank

Ist Teil von

• 2019 Chinese Automation Congress (CAC), 2019, p.4761-4763

Ort / Verlag

IEEE

Erscheinungsjahr

2019

Quelle

IEEE Electronic Library Online

Beschreibungen/Notizen

• Plank Cutting Problem is a classic case of the two-dimensional shearing problem, which has broad application prospects in real life. In this paper, the integer programming model in the plank cutting problem is established, and the verification calculation is carried out by the example in the practical production. Using the LINGO solution, the global optimal solution can be obtained under various constraints.