Minimum flow time graph ordering.

DOI10.1007/B93953MaRDI QIDQ5902508zbMATH OpenFDO

Authors Claudio Arbib, Michele Flammini, Fabrizio Marinelli

Publication date 12 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B93953

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 176780
• Scheduling Flat Graphs
• Optimal vertex ordering of graphs
• Flow shop scheduling problem with conflict graphs
• scientific article; zbMATH DE number 1303559

Cited in

(6)

• Scheduling series-parallel task graphs to minimize peak memory
• The referenced vertex ordering problem: theory, applications, and solution methods
• The pairwise flowtime network construction problem
• Minimization of open orders using interval graphs
• Cutting stock with no three parts per pattern: work-in-process and pattern minimization
• Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges

This page was built for publication: Minimum flow time graph ordering.

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