Scheduling of uniform parallel machines with s-precedence constraints

DOI10.1016/J.MCM.2011.03.001zbMath1225.90052OpenAlexW2080353542MaRDI QIDQ646123

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)

Related Items (1)

Machine scheduling with soft precedence constraints

Cites Work

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

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