Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms

DOI10.1016/J.AMC.2007.02.109MaRDI QIDQ990459zbMATH OpenOpenAlexFDO

Authors Mohammad R. Ranjbar, Fereydoon Kianfar

Publication date 1 September 2010

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2007.02.109

zbMATH Keywords

genetic algorithmproject schedulingtime/resource trade-offs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
• A genetic algorithm for multi-mode resource constrained project scheduling problem
• Local search methods for the discrete time/resource trade-off problem in project networks
• An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case
• Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
• Local search methods for the discrete time/resource trade-off problem in project networks
• Resource-constrained project scheduling: A critical activity reordering heuristic
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation

Cited in

(14)

• On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment
• Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• A survey of variants and extensions of the resource-constrained project scheduling problem
• A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints
• A priority-rule method for project scheduling with work-content constraints
• Optimal workforce assignment to operations of a paced assembly line
• scientific article; zbMATH DE number 558542 (Why is no real title available?)
• Revenue sharing for resource transfer among projects
• Generating a robust baseline schedule for the robust discrete time/resource trade-off problem under work content uncertainty
• Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
• A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems

This page was built for publication: Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms

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