Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing
Better approximation guarantees for job-shop scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Data Structures and Algorithms
Data Structures and Algorithms
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Job shop scheduling with unit processing times
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Job Shop Scheduling with Unit Processing Times
Mathematics of Operations Research
Hardness of Approximating Flow and Job Shop Scheduling Problems
Journal of the ACM (JACM)
Mathematical models for preemptive shop scheduling problems
Computers and Operations Research
Subsequence packing: complexity, approximation, and application
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Non-clairvoyant weighted flow time scheduling on different multi-processor models
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An optimal method for the preemptive job shop scheduling problem
Computers and Operations Research
| Hi-index | 0.00 |
We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most Pmax/2 greater than the optimal schedule length, where Pmax is the length of the longest job.