scientific article; zbMATH DE number 1757970

zbMATH Open1010.90025MaRDI QIDQ4537758FDOQ4537758

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

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (16)

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

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)