On a comparison between the strip packing problem and a scheduling problem

zbMATH Open1249.90075MaRDI QIDQ3115698FDOQ3115698

Authors: I. A. Rykov 

Publication date: 10 February 2012

Recommendations

• The problem of strip packing: An asymptotically exact approach
• An exact approach to the strip-packing problem
• Improved Lower Bound for Online Strip Packing
• Publication:4953918
• A two-phase heuristic for strip packing: Algorithm and probabilistic analysis

zbMATH Keywords

combinatorial optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (2)

• Complexity and inapproximability results for parallel task scheduling and strip packing
• Title not available (Why is that?)

This page was built for publication: On a comparison between the strip packing problem and a scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115698)