Task scheduling with precedence constraints to minimize the total completion time

DOI10.1080/00207729508929163zbMath0836.90093MaRDI QIDQ4859027

Chiun-Chieh Hsu, Jou-Ming Chang

Publication date: 20 December 1995

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729508929163

zbMATH Keywords

sum of completion times; multi-processor system; arbitrary precedence constraints; known execution times; uniprocessor system

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints

Cites Work

• Unnamed Item
• A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
• Optimal task sequencing with precedence constraints
• Scheduling with Deadlines and Loss Functions
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• On the Complexity of Mean Flow Time Scheduling
• Optimal Linear Ordering
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties