Loading [MathJax]/extensions/MathMenu.js
Approximate solutions for a special pagination problem with 2 symbols per tile | IEEE Conference Publication | IEEE Xplore

Approximate solutions for a special pagination problem with 2 symbols per tile


Abstract:

In this paper, we consider a special pagination problem, where we have to assign a set of tiles (or jobs) on two pages (or machines), with the aim of minimizing the used ...Show More

Abstract:

In this paper, we consider a special pagination problem, where we have to assign a set of tiles (or jobs) on two pages (or machines), with the aim of minimizing the used space (or makespan) of the most workloaded page. The specificity of this problem consists in the fact that every tile is composed of two symbols. Moreover, a given symbol can be shared by two (or more) tiles. Thus, the problem is related to two fields: scheduling and graph theory. Given its NP-hardness, we propose different approximate algorithms and we analyse their effectiveness on a large set of instances. The obtained results are promising.
Date of Conference: 03-05 December 2021
Date Added to IEEE Xplore: 10 February 2022
ISBN Information:
Conference Location: Xiamen, China

References

References is not available for this document.