Výsledky vyhledávání - "multiple strip packing"

Akademický článek

Generalized multiple strip packing problem: Formulations, applications, and solution algorithms

Autor: Vasilyev, Igor ^{a, b}, Ushakov, Anton V. ^{a, b, ⁎}, Zhang, Dong ^c, Ren, Jie ^d

Publikováno v: In Computers & Industrial Engineering April 2023 178

Akademický článek

An improvement of previously known upper bound of Multiple Strip Packing problem and probabilistic analysis of algorithm in case of large number of strips given

Autor: Denis Olegovitch Lazarev, Nikolay Nikolaevitch Kuzyurin

Publikováno v: Труды Института системного программирования РАН, Vol 31, Iss 1, Pp 133-142 (2019)

In this article, an analog of previously proposed algorithm Limited Hash Packing for Multiple Strip Packing Problem is studied using probabilistic analysis. Limited Hash Packing is an on-line algorithm, which works in closed-end mode, knowing the num

Externí odkaz: https://doaj.org/article/07a035a53f9e4ba48e095212696666c0

Zobrazit plný text záznamu

Akademický článek

On on-line algorithms for Bin, Strip and Box Packing, and their worstand average-case analysis

Autor: D. O. Lazarev, N. N. Kuzjurin

Publikováno v: Труды Института системного программирования РАН, Vol 30, Iss 4, Pp 209-230 (2018)

In this survey, online algorithms for such packing problems as Bin Packing, Strip Packing and their generalizations, such as Multidimensional Bin Packing, Multiple Strip Packing and packing into strips of different width were considered. For the latt

Externí odkaz: https://doaj.org/article/56b4b2229c3447e69665113c6b4ef323

Zobrazit plný text záznamu

An improvement of previously known upper bound of Multiple Strip Packing problem and probabilistic analysis of algorithm in case of large number of strips given

Autor: D.O. Lazarev, N.N. Kuzyurin

Publikováno v: Труды Института системного программирования РАН, Vol 31, Iss 1, Pp 133-142 (2019)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c9dfccc38367e14ec047ac380df0bc4
https://ispranproceedings.elpub.ru/jour/article/view/1142

Zobrazit plný text záznamu

Tight approximation for scheduling parallel jobs on identical clusters

Autor: Christina Robenek, Pierre-François Dutot, Marin Bougeret, Denis Trystram, Klaus Jansen

Publikováno v: 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum
IPDPSW: International Parallel and Distributed Processing Symposim
IPDPSW: International Parallel and Distributed Processing Symposim, May 2012, Shangai, China. pp.878-885, ⟨10.1109/IPDPSW.2012.108⟩
IPDPS Workshops

International audience; We consider the Multiple Cluster Scheduling Problem (MCSP), where the objective is to schedule n parallel rigid jobs on N identical clusters, minimizing the maximum completion time (makespan). MCSP is 2-inapproximable (unless

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1308dce353fc09486e5a97e4e3cfe52f
https://hal.archives-ouvertes.fr/hal-00738499

Zobrazit plný text záznamu

A fast 5/2-approximation algorithm for hierarchical scheduling

Autor: Marin Bougeret, Christina Otte, Pierre-François Dutot, Denis Trystram, Klaus Jansen

Publikováno v: 16th International Euro-Par Conference, Ischia, Italy, August 31-September 3, 2010, Proceedings, Part I
EUROPAR
EUROPAR, 2010, Ischia, Italy
Euro-Par 2010-Parallel Processing ISBN: 9783642152764
Euro-Par (1)

International audience; We present in this article a new approximation algorithm for scheduling a set of $n$ independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel computing platform. A hierarchical parallel

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7bc0912519e5586d37cec1c6944d55f0
https://hal.archives-ouvertes.fr/hal-00738518/file/main.pdf

Zobrazit plný text záznamu

Kniha

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tight Approximation for Scheduling Parallel Job on Identical Clusters

Autor: Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen, Christina Robenek

Publikováno v: HAL
RR-12001, 2012

In the grid computing paradigm, several clusters share their computing resources in order to distribute the workload. Each of the $N$ cluster is a set of $m$ identical processors (connected by a local interconnection network), and $n$ parallel jobs a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::fd75814df3bd9ca517ba4a503189f634
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00656780

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání