scientific article; zbMATH DE number 2119710

zbMATH Open1093.68545MaRDI QIDQ4828982FDOQ4828982

Authors: Chris N. Potts, Edward J. Anderson 

Publication date: 29 November 2004

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

Recommendations

• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• On-line scheduling on a single machine: Minimizing the total completion time
• Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
• Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
• An optimal online algorithm for single machine scheduling to minimize total general completion time
• On-line scheduling of parallel machines to minimize total completion times
• Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time
• Optimal on-line algorithms for single-machine scheduling
• scientific article; zbMATH DE number 761265

zbMATH Keywords

shortest weighted processing time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (21)

• Title not available (Why is that?)
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
• Machine Scheduling to Minimize Weighted Completion Times
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• A semi-online algorithm for solving the single machine scheduling problem to minimize total weighted completion time with discounted factor
• Completion time scheduling and the WSRPT algorithm
• Competitive analysis of preemptive single-machine scheduling
• A class of on-line scheduling algorithms to minimize total completion time
• Lower bounds for on-line single-machine scheduling.
• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
• Online scheduling with known arrival times
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• On-line scheduling to minimize average completion time revisited.
• Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
• The power of \(\alpha\)-points in preemptive single machine scheduling.
• On the asymptotic optimality of algorithms for the flow shop problem with release dates
• Job scheduling methods for reducing waiting time variance
• Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
• An optimal online algorithm for single machine scheduling to minimize total general completion time
• Approximation and Online 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 Q4828982)