On Bufferless Routing of Variable Length Messages in Leveled Networks
IEEE Transactions on Computers
Resource scheduling for parallel database and scientific applications
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Improved bounds for acyclic job shop scheduling (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Makespan minimization in job shops: a polynomial time approximation scheme
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Better approximation guarantees for job-shop scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
New and improved algorithms for minsum shop scheduling
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Block-cyclic redistribution over heterogeneous networks
Cluster Computing
A 3 /2 Algorithm for Two-Machine Open Shopwith Route-Dependent Processing Times
Journal of Heuristics
On the drift of short schedules
Theoretical Computer Science
Fault-tolerant facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A Randomized Algorithm for Flow Shop Scheduling
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Grouping Techniques for Scheduling Problems: Simpler and Faster
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms
Guaranteed scheduling for switches with configuration overhead
IEEE/ACM Transactions on Networking (TON)
Scheduling problems for parallel dedicated machines under multiple resource constraints
Discrete Applied Mathematics - International symposium on combinatorial optimisation
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
Approximation algorithms for multiprocessor scheduling under uncertainty
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
An improved NEH heuristic to minimize makespan in permutation flow shops
Computers and Operations Research
Improved approximations for multiprocessor scheduling under uncertainty
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
An experimental study of distributed robot coordination
Robotics and Autonomous Systems
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
Improved Bounds for Flow Shop Scheduling
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A fluid approach to large volume job shop scheduling
Journal of Scheduling
Hardness of Approximating Flow and Job Shop Scheduling Problems
Journal of the ACM (JACM)
Fast approximation algorithms for scheduling independent multiprocessor tasks
Proceedings of the 19th High Performance Computing Symposia
Assignment problems in rental markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Scheduling multiple flows on parallel disks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Scheduling on unrelated machines under tree-like precedence constraints
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
Experimentation system for efficient job performing in veterinary medicine area
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Improved approximation algorithms for routing shop scheduling
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
High-multiplicity cyclic job shop scheduling
Operations Research Letters
Towards a centralised appointments system to optimise the length of patient stay
Decision Support Systems
| Hi-index | 0.01 |
In the job shop scheduling problem, there are $m$ machines and $n$ jobs. A job consists of a sequence of operations, each of which must be processed on a specified machine, and the aim is to complete all jobs as quickly as possible. This problem is strongly ${\cal NP}$-hard even for very restrictive special cases. The authors give the first randomized and deterministic polynomial-time algorithms that yield polylogarithmic approximations to the optimal length schedule. These algorithms also extend to the more general case where a job is given not by a linear ordering of the machines on which it must be processed but by an arbitrary partial order. Comparable bounds can also be obtained when there are $m'$ types of machines, a specified number of machines of each type, and each operation must be processed on one of the machines of a specified type, as well as for the problem of scheduling unrelated parallel machines subject to chain precedence constraints.