Algorithms for Partitioning and Packing Problems with Incomplete Information
Received: 11 Nov 2026 Accepted: 11 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 17–26
Abstract
Semi-online algorithms represent an intermediate approach designed to enhance the practical applicability of online and offline scheduling models. Semi-online scheduling is a modified version of online scheduling in which, in addition to the standard input data, extra information (an “Extra Piece of Information,” or EPI) is available, or a buffer is provided for data storage. This paper introduces online and semi-online approaches to partitioning (scheduling in multiprocessor systems) and bin-packing problems, discusses their areas of application and the motivations behind such research, and proposes a general classification of semi-online scheduling models. Furthermore, it outlines the primary methods used in the development and analysis of these algorithms.
Keywords: online version, semi-online version, comparative analysis, guaranteed estimate, lower bound.
BibTeX
@article{IS-Kotov2026,
author = {Kotov, Vladimir Mikhailovich},
title = {{Algorithms for Partitioning and Packing Problems with Incomplete Information}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {17--26},
}
AMSBIB
\Bibitem{IS-Kotov2026}
\by V.\,M.~Kotov
\paper Algorithms for Partitioning and Packing Problems with Incomplete Information
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 17--26
\lang In Russian
RU