Discrete Time-Cost Tradeoff with a Novel Hybrid Meta-Heuristic
From MaRDI portal
Publication:3556554
DOI10.1007/978-3-642-04045-0_15zbMATH Open1184.90175OpenAlexW984116902MaRDI QIDQ3556554FDOQ3556554
Kalyanmoy Deb, Sanjay Srivastava, Bhupendra K. Pathak, Kamal Srivastava
Publication date: 24 April 2010
Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04045-0_15
Recommendations
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- The discrete time-cost tradeoff problem revisited
- A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem
- New computational results for the discrete time/cost trade-off problem with time-switch constraints
- Approximation algorithms for the discrete time-cost tradeoff problem
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
- Local search metaheuristics for discrete-continuous scheduling problems
- scientific article; zbMATH DE number 1054932
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
This page was built for publication: Discrete Time-Cost Tradeoff with a Novel Hybrid Meta-Heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3556554)