Application of digraph theory to process scheduling

zbMATH Open1179.90143MaRDI QIDQ3415065FDOQ3415065

Authors:

Publication date: 15 January 2007

Recommendations

• scientific article; zbMATH DE number 4023002
• Scheduling Graphs on Two Processors
• scientific article; zbMATH DE number 962288
• The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
• Algorithm decision for two combinatorial optimization questions

zbMATH Keywords

matrixdigraphprocess schedulingCAPP (computer aided process planning)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Deterministic scheduling theory in operations research (90B35)

Cited In (3)

• Process flexibility revisited: the graph expander and its applications
• Title not available (Why is that?)
• Directed hypergraph based and resource constrained enterprise process structure optimization

This page was built for publication: Application of digraph theory to process scheduling

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