scientific article; zbMATH DE number 15416

zbMATH Open0760.90056MaRDI QIDQ3972053FDOQ3972053

Authors: Leo Kroon, Günther Ruhe 

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4023002
• scientific article; zbMATH DE number 1929963
• On the approximability of an interval scheduling problem
• Scheduling in network flow shops
• scientific article; zbMATH DE number 1182771
• scientific article; zbMATH DE number 4031379
• scientific article; zbMATH DE number 4093159
• Preemptive Scheduling, Linear Programming and Network Flows
• Dynamic Scheduling of a Multiclass Fluid Network
• Flow in network modeling time tabling and scheduling problem

zbMATH Keywords

fixed job scheduling problemminimum cost flow problemadditional constraintssurrogate constraintsparametric flowsintegrality demand

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (4)

• Scheduling jobs with fixed start and end times
• On solving maximum and quickest interval-valued flows over time
• Integrated job scheduling and network routing
• Solution of interval PERT/CPM network problems by a simplified tabular method

This page was built for publication:

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