Machine Scheduling to Minimize Weighted Completion Times

DOI10.1007/978-3-319-77528-9MaRDI QIDQ4636336zbMATH OpenOpenAlexFDO

Authors Nicolò Gusmeroli

Publication date 23 April 2018

Published in SpringerBriefs in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-77528-9

zbMATH Keywords

approximation algorithmsmachine schedulingon-line algorithmrelease datestotal weighted completion timeprecedence constraintslinear programming relaxationperformance guarantee

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25)

Recommendations

• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
• Computation of approximate -points for large scale single machine scheduling problem
• Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
• The power of \(\alpha\)-points in preemptive single machine scheduling.
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
• scientific article; zbMATH DE number 2119710
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

Cited in

(1)

• Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times

This page was built for publication: Machine Scheduling to Minimize Weighted Completion Times

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