Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
On the performance of on-line algorithms for partition problems
Acta Cybernetica
New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling
SIAM Journal on Computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A lower bound for randomized on-line scheduling algorithms
Information Processing Letters
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A better algorithm for an ancient scheduling problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Online Load Balancing of Temporary Tasks
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
On-Line Load Balancing of Temporary Tasks on Identical Machines
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Semi on-line algorithms for the partition problem
Operations Research Letters
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks
Journal of Scheduling
Semi-on-line multiprocessor scheduling with given total processing time
Theoretical Computer Science
Incomplete solution approach for the maximum clique finding in the real time systems
AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
Theoretical Computer Science
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics - Special issue: Max-algebra
Optimal semi-online algorithms for machine covering
Theoretical Computer Science
Semi-online scheduling problems on two identical machines with inexact partial information
Theoretical Computer Science
On places suitable for applying AI principles in NP-hard graph problems' algorithms
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
List scheduling for jobs with arbitrary release times and similar lengths
Journal of Scheduling
A classification scheme for bin packing theory
Acta Cybernetica
An approach for the maximum clique finding problem test tool software engineering
SE'07 Proceedings of the 25th conference on IASTED International Multi-Conference: Software Engineering
Artificial intelligence in the maximum clique finding problem applications
ICAI'06 Proceedings of the 7th WSEAS International Conference on Automation & Information
Two semi-online scheduling problems on two uniform machines
Theoretical Computer Science
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Journal of Combinatorial Optimization
Applying AI and incomplete solution principles to solve NP-hard problems in the real-time systems
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Semi-online problems on identical machines with inexact partial information
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Preemptive semi-online scheduling on parallel machines with inexact partial information
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An overview on automatic capacity planning
From Integrated Publication and Information Systems to Virtual Information and Knowledge Environments
Semi-online scheduling revisited
Theoretical Computer Science
Online scheduling with reassignment
Operations Research Letters
Several semi-online scheduling problems on two identical machines with combined information
Theoretical Computer Science
Optimal semi-online scheduling algorithms on a small number of machines
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Recent advances for a classical scheduling problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Semi-online scheduling problems on a small number of machines
Journal of Scheduling
| Hi-index | 5.23 |
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we fix the size of the bins and try to pack the items in the minimum number of such bins. In contrast, in the bin-stretching problem we fix the number of bins and try to pack the items while stretching the size of the bins as least as possible. We present two on-line algorithms for the bin-stretching problem that guarantee a stretching factor of 5/3 for any number m of bins. We then combine the two algorithms and design an algorithm whose stretching factor is 1:625 for any m. The analysis for the performance of this algorithm is tight. The best lower bound for any algorithm is 4/3 for any m≥2. We note that the bin-stretching problem is also equivalent to the classical scheduling (load balancing) problem in which the value of the makespan (maximum load) is known in advance. Copyright 2001 Elsevier Science B.V.