e-ISSN:0976-5166
p-ISSN:2231-3850


INDIAN JOURNAL OF COMPUTER SCIENCE AND ENGINEERING

Call for Papers 2020

Oct 2020 - Volume 11, Issue 5
Deadline: 15 Sep 2020
Notification: 15 Oct 2020
Publication: 31 Oct 2020

Dec 2020 - Volume 11, Issue 6
Deadline: 15 Nov 2020
Notification: 15 Dec 2020
Publication: 31 Dec 2020

More

Indexed in

IJCSE Indexed in Scopus

ABSTRACT

Title : PATTERN GENERATION FOR TWO-DIMENSIONAL CUTTING STOCK PROBLEM WITH LOCATION
Authors : W.N.P Rodrigo, W.B Daundasekera, A.A.I Perera
Keywords : Two-dimensional cutting stock problem; Pattern generation; Branch and Bound Algorithm.
Issue Date : Apr-May 2012
Abstract :
Selection of feasible cutting patterns in order to minimize the raw material wastage which is known as cutting stock problem has become a key factor of the success in today’s competitive manufacturing industries. In this paper, solving a rectangular shape medium size two-dimensional cutting stock problem is discussed. Our study is restricted to raw materials (main sheets) in a rectangular shape with fixed sizes, and cutting items are also considered as rectangular shape with known dimensions and location of each feasible cutting pattern inside the main sheet is given in Cartesian Coordinate Plane. The Branch and Bound approach in solving integer programming problems is used to solve the problem.
Page(s) : 354-368
ISSN : 0976-5166
Source : Vol. 3, No.2