scientific article; zbMATH DE number 1226310

zbMATH Open0908.90118MaRDI QIDQ4220472

Miklós Hajdu

Publication date: 23 November 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

network flow theorytime-cost trade-off problem

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (1)

Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Efficient algorithms for the temporal precedence problem 👍 👎
• Optimal solutions for the temporal precedence problem 👍 👎
• Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations 👍 👎
• Certain exact and approximate algorithms for solving precedence problems with constraints 👍 👎
• A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph 👍 👎
• Decision diagrams for solving a job scheduling problem under precedence constraints 👍 👎
• A Precedence Graph Algorithm for the Shop Scheduling Problem 👍 👎
• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations 👍 👎

This page was built for publication: