scientific article; zbMATH DE number 1757970

MaRDI QIDQ4537758zbMATH OpenFDO

Authors René A. Sitters

Publication date 20 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810396

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) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Complexity of preemptive minsum scheduling on unrelated parallel machines
• Minimizing the number of late jobs on unrelated machines
• The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• On the complexity of preemptive open-shop scheduling problems

Cited in

(16)

• How useful are preemptive schedules?
• Scheduling divisible loads with time and cost constraints
• Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
• A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines
• Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
• Designing PTASs for MIN-SUM scheduling problems
• Faster algorithms for semi-matching problems
• Power of preemption for minimizing total completion time on uniform parallel machines
• A note on the paper ``Minimizing total tardiness on parallel machines with preemptions
• Preemptive parallel-machine scheduling with a common server to minimize makespan
• Complexity of preemptive minsum scheduling on unrelated parallel machines
• The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem
• On the complexity of scheduling unrelated parallel machines with limited preemptions
• A scheduling framework for distributed key-value stores and its application to tail latency minimization
• Minimizing the number of late jobs on unrelated machines
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms

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 Q4537758)