Found: 35
Select item for more details and to access through your institution.
Bin stretching with migration on two hierarchical machines.
- Published in:
- Mathematical Methods of Operations Research, 2023, v. 98, n. 1, p. 111, doi. 10.1007/s00186-023-00830-3
- By:
- Publication type:
- Article
Parallel solutions for preemptive makespan scheduling on two identical machines.
- Published in:
- Journal of Scheduling, 2023, v. 26, n. 1, p. 61, doi. 10.1007/s10951-022-00764-4
- By:
- Publication type:
- Article
More on ordered open end bin packing.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 6, p. 589, doi. 10.1007/s10951-021-00709-3
- By:
- Publication type:
- Article
Special Issue on Approximation and Online Algorithms.
- Published in:
- 2020
- By:
- Publication type:
- Editorial
Correction to: Special Issue on Approximation and Online Algorithms.
- Published in:
- 2020
- By:
- Publication type:
- Correction Notice
An optimal online algorithm for scheduling with general machine cost functions.
- Published in:
- Journal of Scheduling, 2020, v. 23, n. 2, p. 155, doi. 10.1007/s10951-019-00629-3
- By:
- Publication type:
- Article
Lower Bounds for Several Online Variants of Bin Packing.
- Published in:
- Theory of Computing Systems, 2019, v. 63, n. 8, p. 1757, doi. 10.1007/s00224-019-09915-1
- By:
- Publication type:
- Article
Quality of strong equilibria for selfish bin packing with uniform cost sharing.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 473, doi. 10.1007/s10951-018-0587-8
- By:
- Publication type:
- Article
Lower bounds for online bin covering-type problems.
- Published in:
- Journal of Scheduling, 2019, v. 22, n. 4, p. 487, doi. 10.1007/s10951-018-0590-0
- By:
- Publication type:
- Article
Online-bounded analysis.
- Published in:
- Journal of Scheduling, 2018, v. 21, n. 4, p. 429, doi. 10.1007/s10951-017-0536-y
- By:
- Publication type:
- Article
A survey on makespan minimization in semi-online environments.
- Published in:
- Journal of Scheduling, 2018, v. 21, n. 3, p. 269, doi. 10.1007/s10951-018-0567-z
- By:
- Publication type:
- Article
The Metric Dimension of Two-Dimensional Extended Meshes.
- Published in:
- Acta Cybernetica, 2018, v. 23, n. 3, p. 761, doi. 10.14232/actacyb.23.3.2018.2
- By:
- Publication type:
- Article
The Convergence Time for Selfish Bin Packing.
- Published in:
- Acta Cybernetica, 2018, v. 23, n. 3, p. 853, doi. 10.14232/actacyb.23.3.2018.8
- By:
- Publication type:
- Article
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times.
- Published in:
- Journal of Scheduling, 2017, v. 20, n. 2, p. 115, doi. 10.1007/s10951-016-0476-y
- By:
- Publication type:
- Article
A Unified Approach to Truthful Scheduling on Related Machines.
- Published in:
- Mathematics of Operations Research, 2016, v. 41, n. 1, p. 332, doi. 10.1287/moor.2015.0730
- By:
- Publication type:
- Article
Rent or Buy Problems with a Fixed Time Horizon.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 2, p. 309, doi. 10.1007/s00224-014-9552-x
- By:
- Publication type:
- Article
Online Results for Black and White Bin Packing.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 1, p. 137, doi. 10.1007/s00224-014-9538-8
- By:
- Publication type:
- Article
An efficient polynomial time approximation scheme for load balancing on uniformly related machines.
- Published in:
- Mathematical Programming, 2014, v. 147, n. 1/2, p. 1, doi. 10.1007/s10107-013-0706-4
- By:
- Publication type:
- Article
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines.
- Published in:
- Journal of Scheduling, 2014, v. 17, n. 1, p. 87, doi. 10.1007/s10951-013-0326-0
- By:
- Publication type:
- Article
Bin packing with general cost structures.
- Published in:
- Mathematical Programming, 2012, v. 132, n. 1/2, p. 355, doi. 10.1007/s10107-010-0403-5
- By:
- Publication type:
- Article
Comparing online algorithms for bin packing problems.
- Published in:
- Journal of Scheduling, 2012, v. 15, n. 1, p. 13, doi. 10.1007/s10951-009-0129-5
- By:
- Publication type:
- Article
Improved Results for a Memory Allocation Problem.
- Published in:
- Theory of Computing Systems, 2011, v. 48, n. 1, p. 79, doi. 10.1007/s00224-009-9226-2
- By:
- Publication type:
- Article
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy.
- Published in:
- Acta Informatica, 2010, v. 47, n. 7/8, p. 375, doi. 10.1007/s00236-010-0124-5
- By:
- Publication type:
- Article
Minimization of SONET ADMs in ring networks revisited.
- Published in:
- Computing, 2010, v. 87, n. 1/2, p. 3, doi. 10.1007/s00607-009-0072-5
- By:
- Publication type:
- Article
Class Constrained Bin Covering.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 2, p. 246, doi. 10.1007/s00224-008-9129-7
- By:
- Publication type:
- Article
On Online Bin Packing with LIB Constraints.
- Published in:
- Naval Research Logistics, 2009, v. 56, n. 8, p. 780, doi. 10.1002/nav.20383
- By:
- Publication type:
- Article
A robust APTAS for the classical bin packing problem.
- Published in:
- Mathematical Programming, 2009, v. 119, n. 1, p. 33, doi. 10.1007/s10107-007-0200-y
- By:
- Publication type:
- Article
Paging with Request Sets.
- Published in:
- Theory of Computing Systems, 2009, v. 44, n. 1, p. 67, doi. 10.1007/s00224-007-9029-2
- By:
- Publication type:
- Article
Two-dimensional packing with conflicts.
- Published in:
- Acta Informatica, 2008, v. 45, n. 3, p. 155, doi. 10.1007/s00236-007-0067-7
- By:
- Publication type:
- Article
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation.
- Published in:
- Theory of Computing Systems, 2008, v. 42, n. 4, p. 431, doi. 10.1007/s00224-007-9007-8
- By:
- Publication type:
- Article
Vector assignment schemes for asymmetric settings.
- Published in:
- Acta Informatica, 2006, v. 42, n. 6/7, p. 501, doi. 10.1007/s00236-005-0003-7
- By:
- Publication type:
- Article
Online square and cube packing.
- Published in:
- Acta Informatica, 2005, v. 41, n. 9, p. 595, doi. 10.1007/s00236-005-0169-z
- By:
- Publication type:
- Article
Approximation schemes for the Min-Max Starting Time Problem.
- Published in:
- Acta Informatica, 2004, v. 40, n. 9, p. 657, doi. 10.1007/s00236-004-0145-z
- By:
- Publication type:
- Article
Approximation schemes for the Min-Max Starting Time Problem.
- Published in:
- Acta Informatica, 2004, v. 40, n. 8, p. 657, doi. 10.1007/s00236-004-0145-z
- By:
- Publication type:
- Article
Bin stretching revisited.
- Published in:
- Acta Informatica, 2003, v. 39, n. 2, p. 97, doi. 10.1007/s00236-002-0102-7
- By:
- Publication type:
- Article