On the weak computability of a four dimensional orthogonal packing and time scheduling problem

DOI10.1016/j.tcs.2013.07.023zbMath1296.68048OpenAlexW2013483504MaRDI QIDQ391303

Wenqi Huang, Kun He

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.023

zbMATH Keywords

schedulingcomputabilityexact algorithmhigher dimensional packingreal parameters

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• Approximation algorithms for orthogonal packing problems for hypercubes
• Best packing of rods into boxes
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• A Maximal-Space Algorithm for the Container Loading Problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An Application of Bin-Packing to Multiprocessor Scheduling
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• A heuristic algorithm for cube packing with time schedule
• Hardness of Approximating Flow and Job Shop Scheduling Problems
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing