scientific article; zbMATH DE number 1979517

zbMATH Open1019.68009MaRDI QIDQ4427861

Antonio Miranda, Luz Gloria Torres, Jianer Chen

Publication date: 14 September 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2518/25180403.htm

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (31)

Scheduling in the presence of processor networks : complexity and approximation ⋮ Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems ⋮ On the worst-case ratio of a compound multiprocessor scheduling algorithm ⋮ Polynomial time approximation schemes for general multiprocessor job shop scheduling ⋮ On multiprocessor task scheduling using efficient state space search approaches ⋮ On a scheduling problem where a job can be executed only by a limited number of processors ⋮ An LPT-bound for a parallel multiprocessor scheduling problem ⋮ Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors ⋮ Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing ⋮ Partial solutions and multifit algorithm for multiprocessor scheduling ⋮ Scheduling multiprocessor tasks on parallel processors with limited availability. ⋮ APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS ⋮ A polynomial time approximation scheme for general multiprocessor job scheduling ⋮ Proportional scheduling, split-proofness, and merge-proofness ⋮ ILP formulations for scheduling ordered tasks on a bounded number of processors ⋮ Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times ⋮ Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks ⋮ Tighter Bounds for the Multifit Processor Scheduling Algorithm ⋮ Title not available (Why is that?) ⋮ Complexity and inapproximability results for parallel task scheduling and strip packing ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time ⋮ The Research of Method Based on Complex Multi-task Parallel Scheduling Problem ⋮ Approximation Algorithms For Scheduling On Uniform Processors ⋮ Lower bound algorithms for multiprocessor task scheduling with ready times ⋮ Title not available (Why is that?) ⋮ Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times ⋮ A parallel approximation scheme for the multiprocessor scheduling problem ⋮ An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems ⋮ Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427861)