کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
476205 | 699427 | 2008 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An enumeration scheme to generate constrained exact checkerboard patterns
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An enumeration scheme to generate constrained exact checkerboard patterns An enumeration scheme to generate constrained exact checkerboard patterns](/preview/png/476205.png)
چکیده انگلیسی
Checkerboard patterns belong to a special class of 2-stage guillotine patterns that require less machine time to be cut. In this paper we propose an enumerative algorithm to generate exact constrained checkerboard patterns. At each node of the enumeration tree a constructive procedure is used to generate a feasible pattern. In addition, an upper bound on the objective function value is calculated to decide whether further branching from the node is worth. The algorithm was implemented and computational tests were performed. The test results indicate that the proposed scheme outperforms previous methods of the literature in terms of execution times.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 35, Issue 6, June 2008, Pages 2114-2128
Journal: Computers & Operations Research - Volume 35, Issue 6, June 2008, Pages 2114-2128
نویسندگان
Horacio Hideki Yanasse, Daniel Massaru Katsurayama,