A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints

DOI10.3785/J.ISSN.1008-9497.2008.06.006zbMATH Open1183.90202MaRDI QIDQ3402964FDOQ3402964

Authors Aifeng Yang, Jinjiang Yuan 

Publication date 12 February 2010

zbMATH Keywords

schedulingsingle machineprecedence constraintsfixed-jobs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximability of single machine scheduling with fixed jobs to minimize total completion time
• On the approximability of single-machine scheduling with precedence constraints
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• Single machine scheduling subject to precedence delays
• Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria

Cited in

(1)

• Approximability of single machine scheduling with fixed jobs to minimize total completion time

This page was built for publication: A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints

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