Zobrazeno 1 - 10
of 272
pro vyhledávání: '"Leah Epstein"'
Publikováno v:
Journal of Computer and System Sciences, 134, 42-72. Academic Press Inc.
Semi-online models where decisions may be revoked in a limited way have been studied extensively in the last years. This is motivated by the fact that the pure online model is often too restrictive to model real-world applications, where some changes
Autor:
Leah Epstein, Loay Mualem
Publikováno v:
Algorithmica. 85:1415-1458
In the d-dimensional online bin packing problem, d-dimensional cubes of positive sizes no larger than 1 are presented one by one to be assigned to positions in d-dimensional unit cube bins. In this work, we provide improved upper bounds on the asympt
Autor:
Leah Epstein
Publikováno v:
Discrete Applied Mathematics. 321:220-239
We analyze a recently introduced concept, called the price of clustering, for variants of bin packing called open-end bin packing problems (OEBP). Input items have sizes, and they also belong to a certain number of types. The new concept deals with t
Autor:
Islam Akaria, Leah Epstein
Publikováno v:
Journal of Combinatorial Optimization. 44:3535-3548
Autor:
Leah Epstein, Asaf Levin
Publikováno v:
Discrete Applied Mathematics. 307:79-87
We consider a scheduling problem on identical machines, where the cost for each machine is the total size of jobs assigned to it, excluding its largest job. The objective is to minimize the cost of the schedule, which is the maximum cost over all mac
Publikováno v:
Journal of Combinatorial Optimization. 43:613-629
We consider batched bin packing. Items are presented in a constant number of batches, and each batch should be packed before the next batch is presented. The cases of two, three, and four batches are studied. We prove improved lower bounds for the st
Autor:
Leah Epstein
We consider online preemptive scheduling of jobs arriving one by one, to be assigned to two identical machines, with the goal of makespan minimization. We study the effect of selecting the best solution out of two independent solutions constructed in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94c137d8328ff57d207d9a154ee60875
http://arxiv.org/abs/2210.05543
http://arxiv.org/abs/2210.05543
Autor:
Leah Epstein, Elena Kleiman
Publikováno v:
Algorithmica. 83:2952-2988
We study the multidimensional vector packing problem with selfish items. An item is a d-dimensional non-zero vector, whose rational components are in [0, 1]. A set of items can be packed into a bin if for every $$1 \le i \le d$$ , the sum of the ith
Autor:
Leah Epstein, Asaf Levin
Publikováno v:
Operations Research Letters. 48:844-849
We study the minimum variant of the online open end bin packing problem. Items are presented one by one, and an item can be packed into a bin while the resulting total size of items excluding the minimum size item of the bin will be below 1. We desig
Publikováno v:
Journal of Computer and System Sciences. 112:34-49
Cardinality constrained bin packing or bin packing with cardinality constraints is a basic bin packing problem. In the online version with the parameter k >= 2, items having sizes in (0,1] associated with them are presented one by one to be packed in