Scheduling of uniform parallel machines with s-precedence constraints

DOI10.1016/J.MCM.2011.03.001MaRDI QIDQ646123zbMATH OpenOpenAlexFDO

Authors Eun-Seok Kim

Publication date 11 November 2011

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2011.03.001

zbMATH Keywords

heuristicprecedence constraintsuniform parallel machine schedulingweighted total completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
• Precedence constrained parallel-machine scheduling of position-dependent jobs
• Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
• Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
• Heuristics for unrelated machine scheduling with precedence constraints

Cites work

• scientific article; zbMATH DE number 1187166 (Why is no real title available?)
• A comment on scheduling on uniform machines under chain-type precedence constraints
• Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Geometric algorithms and combinatorial optimization.
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel Processing and Applied Mathematics
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling chains on uniform processors with communication delays
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
• Structure of a simple scheduling polyhedron

Cited in

(6)

• Uniform parallel machine scheduling problems with fixed machine cost
• scientific article; zbMATH DE number 5669900 (Why is no real title available?)
• Parallel dedicated machines scheduling with chain precedence constraints
• The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints
• Machine scheduling with soft precedence constraints
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints

This page was built for publication: Scheduling of uniform parallel machines with s-precedence constraints

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