Scheduling of uniform parallel machines with s-precedence constraints

DOI10.1016/J.MCM.2011.03.001zbMATH Open1225.90052OpenAlexW2080353542MaRDI QIDQ646123FDOQ646123

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

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

zbMATH Keywords

heuristicprecedence constraintsuniform parallel machine schedulingweighted total completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (6)

• Uniform parallel machine scheduling problems with fixed machine cost
• Title not available (Why is that?)
• 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)