Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Computational Efficiency of Parallel Combinatorial OR-Tree Searches
IEEE Transactions on Software Engineering
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
A PTAS for minimizing the weighted sum of job completion times on parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
P-Complete Approximation Problems
Journal of the ACM (JACM)
The Power of Dominance Relations in Branch-and-Bound Algorithms
Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors
Journal of the ACM (JACM)
Improvements in throughout maximization for real-time scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs
Journal of Heuristics
Scheduling Multiclass Packet Streams to Minimize Weighted Loss
Queueing Systems: Theory and Applications
An improved FPTAS for restricted shortest path
Information Processing Letters
Off-line temporary tasks assignment
Theoretical Computer Science
An FPTAS for Agreeably Weighted Variance on a Single Machine
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On-Line Deadline Scheduling on Multiple Resources
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Online real-time preemptive scheduling of jobs with deadlines
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Vector Assignment Problems: A General Framework
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Designing PTASs for MIN-SUM Scheduling Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Scheduling file transfers in a distributed network
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
On energy-optimal voltage scheduling for fixed-priority hard real-time systems
ACM Transactions on Embedded Computing Systems (TECS)
An approximation algorithm for scheduling two parallel machines with capacity constraints
Discrete Applied Mathematics
Vector assignment problems: a general framework
Journal of Algorithms
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Minimizing Labor Requirements in a Periodic Vehicle Loading Problem
Computational Optimization and Applications
A new average case analysis for completion time scheduling
Journal of the ACM (JACM)
Scheduling two-stage hybrid flow shop with availability constraints
Computers and Operations Research
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
Theoretical Computer Science
Load balancing of temporary tasks in the lp norm
Theoretical Computer Science - Approximation and online algorithms
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
Approximation schemes for a class of subset selection problems
Theoretical Computer Science
Batch scheduling to minimize the weighted number of tardy jobs
Computers and Industrial Engineering
Computers and Industrial Engineering
Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to the learning effect: Beyond the learning curve restrictions
Computers and Operations Research
Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Note: FPTAS for half-products minimization with scheduling applications
Discrete Applied Mathematics
Encouraging Cooperation in Sharing Supermodular Costs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Online Scheduling with Bounded Migration
Mathematics of Operations Research
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
Scalable computing with parallel tasks
Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints
Computers and Industrial Engineering
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Approximation algorithms for scheduling with reservations
HiPC'07 Proceedings of the 14th international conference on High performance computing
Randomized priority algorithms
Theoretical Computer Science
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
Virtual appliance content distribution for a global infrastructure cloud service
INFOCOM'10 Proceedings of the 29th conference on Information communications
Scheduling with bully selfish jobs
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Two-machine flow-shop scheduling with rejection
Computers and Operations Research
Hardness of Precedence Constrained Scheduling on Identical Machines
SIAM Journal on Computing
On bilevel machine scheduling problems
OR Spectrum
Computing mobile agent routes with node-wise constraints in distributed communication systems
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
A bicriteria approach to scheduling a single machine with job rejection and positional penalties
Journal of Combinatorial Optimization
Two due date assignment problems in scheduling a single machine
Operations Research Letters
A new dynamic programming algorithm for the parallel machines total weighted completion time problem
Operations Research Letters
Improving the complexities of approximation algorithms for optimization problems
Operations Research Letters
Approximation algorithms for scheduling a single machine to minimize total late work
Operations Research Letters
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
Combination of parallel machine scheduling and vertex cover
Theoretical Computer Science
Sequence automata for researching consensus levels
Transactions on Computational Collective Intelligence VIII
A survey on offline scheduling with rejection
Journal of Scheduling
Approximating multi-objective scheduling problems
Computers and Operations Research
Multi-query scheduling for time-critical data stream applications
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Smart-Grid electricity allocation via strip packing with slicing
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
Theoretical Computer Science
Autonomous Agents and Multi-Agent Systems
Combined scheduling and mapping for scalable computing with parallel tasks
Scientific Programming - Biological Knowledge Discovery and Data Mining
| Hi-index | 0.01 |
The following job sequencing problems are studied: (i) single processor job sequencing with deadlines, (ii) job sequencing on m-identical processors to minimize finish time and related problems, (iii) job sequencing on 2-identical processors to minimize weighted mean flow time.Dynamic programming type algorithms are presented to obtain optimal solutions to these problems, and three general techniques are presented to obtain approximate solutions for optimization problems solvable in this way. The techniques are applied to the problems above to obtain polynomial time algorithms that generate “good” approximate solutions.