A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem

DOI10.1287/ijoc.1100.0394zbMath1243.90184OpenAlexW1984386185WikidataQ57387728 ScholiaQ57387728MaRDI QIDQ2899099

Grzegorz Pawlak, Sławomir Bąk, Jacek Błażewicz, MacIej Płaza, Graham Kendall, Edmund Kieran Burke

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a302a2b911540efb93b7a33b4e8b4860158138d9

zbMATH Keywords

production schedulinganalysis of algorithmscutting stockmaterial handlingparallel branch-and-bound method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (4)

A block-based layer building approach for the 2D guillotine strip packing problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions

This page was built for publication: A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem