Search Results - "Epstein, Leah"

Reflections on the Pandemic : COVID and Social Crises in the Year Everything Changed

Authors: Teresa Politano

Resource Type: eBook.

Subjects: COVID-19 Pandemic, 2020-2023--Social aspects--New Jersey--New Brunswick, COVID-19 Pandemic, 2020-2023--Literary collections, American literature--21st century, Universities and colleges--New Jersey--New Brunswick, COVID-19 Pandemic, 2020-2023--New Jersey--New Brunswick--Anecdotes

Categories: LITERARY COLLECTIONS / General, EDUCATION / Schools / Levels / Higher, HISTORY / United States / State & Local / Middle Atlantic (DC, DE, MD, NJ, NY, PA), LITERARY COLLECTIONS / Essays, POETRY / Anthologies (multiple authors), SOCIAL SCIENCE / Disease & Health Issues

Makespan minimization for ordinal cardinality constrained scheduling.

Authors: Epstein, Leah Lassota, Alexandra Levin, Asaf et al.

Source: Discrete Applied Mathematics; Jul2026, Vol. 387, p234-250, 17p

Semi-online models for cardinality constrained bin packing.

Authors: Epstein, Leah Levin, Asaf

Source: Journal of Scheduling; Feb2026, Vol. 29 Issue 1, p51-66, 16p

Bin stretching with migration on two hierarchical machines.

Authors: Akaria, Islam Epstein, Leah

Source: Mathematical Methods of Operations Research; Aug2023, Vol. 98 Issue 1, p111-153, 43p

Semi-online scheduling with non-increasing job sizes and a buffer.

Authors: Epstein, Leah Zebedat-Haider, Hanan

Source: Journal of Combinatorial Optimization. May2025, Vol. 49 Issue 4, p1-23. 23p.

More on ordered open end bin packing.

Authors: Balogh, János Epstein, Leah Levin, Asaf

Source: Journal of Scheduling; Dec2021, Vol. 24 Issue 6, p589-614, 26p

Parallel solutions for preemptive makespan scheduling on two identical machines.

Authors: Epstein, Leah¹, lea@math.haifa.ac.il

Source: Journal of Scheduling; Feb2023, Vol. 26 Issue 1, p61-76, 16p

An optimal online algorithm for scheduling with general machine cost functions.

Authors: Akaria, Islam Epstein, Leah

Source: Journal of Scheduling; Apr2020, Vol. 23 Issue 2, p155-162, 8p

Lower Bounds for Several Online Variants of Bin Packing.

Authors: Balogh, János Békési, József Dósa, György et al.

Source: Theory of Computing Systems; Nov2019, Vol. 63 Issue 8, p1757-1780, 24p

Lower bounds for online bin covering-type problems.

Authors: Balogh, János Epstein, Leah Levin, Asaf

Source: Journal of Scheduling; Aug2019, Vol. 22 Issue 4, p487-497, 11p

Quality of strong equilibria for selfish bin packing with uniform cost sharing.

Authors: Dósa, György Epstein, Leah

Source: Journal of Scheduling; Aug2019, Vol. 22 Issue 4, p473-485, 13p

Correction to: Special Issue on Approximation and Online Algorithms.

Authors: Epstein, Leah Erlebach, Thomas

Source: Theory of Computing Systems; May2020, Vol. 64 Issue 4, p571-571, 1p

An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines.

Authors: Epstein, Leah Levin, Asaf

Source: Information & Computation; Jun2026, Vol. 311, pN.PAG-N.PAG, 1p

Lower bounds on the performance of online algorithms for relaxed packing problems.

Authors: Balogh, János Dósa, György Epstein, Leah et al.

Source: Discrete Optimization; May2026, Vol. 60, pN.PAG-N.PAG, 1p

More on online cardinality constrained bin packing with small cardinality bounds.

Authors: Balogh, János Békési, József Dósa, György et al.

Source: Theoretical Computer Science; Apr2026, Vol. 1068, pN.PAG-N.PAG, 1p

Special Issue on Approximation and Online Algorithms.

Authors: Epstein, Leah Erlebach, Thomas

Source: Theory of Computing Systems; May2020, Vol. 64 Issue 4, p569-570, 2p

Parallel solutions for ordinal scheduling with a small number of machines.

Authors: Epstein, Leah¹ (AUTHOR) lea@math.haifa.ac.il

Source: Journal of Combinatorial Optimization. Aug2023, Vol. 46 Issue 1, p1-24. 24p.

Online scheduling with migration on two hierarchical machines.

Authors: Akaria, Islam Epstein, Leah

Source: Journal of Combinatorial Optimization. Dec2022, Vol. 44 Issue 5, p3535-3548. 14p.

A dynamic plate design problem via reinforcement learning.

Authors: Shi, Fengyuan Meng, Ying Tang, Lixin et al.

Source: International Journal of Production Research. Jun2026, Vol. 64 Issue 11, p4606-4634. 29p.

Subjects: Reinforcement learning, Cutting stock problem, Steel industry, Markov processes, Resource management, Mathematical optimization

Online cardinality constrained scheduling.

Authors: Epstein, Leah Lassota, Alexandra Levin, Asaf et al.

Source: Operations Research Letters; Sep2023, Vol. 51 Issue 5, p533-539, 7p