Abstract
The article considers the mathematical formulation of the Resource-Constrained Project Scheduling Problem (RCPSP). The RCPSP structure is represented by a graph. The article regards some special cases of RCPSP for which at present there exist either exact deterministic polynomial algorithms for their solving or approximate heuristic algorithms that find an approximate optimal solution in polynomial time.
Highlights
The basic concept for machine scheduling problems (MS) is an operation [1]
The article considers the mathematical formulation of the Resource-Constrained Project Scheduling Problem (RCPSP)
The article regards some special cases of RCPSP for which at present there exist either exact deterministic polynomial algorithms for their solving or approximate heuristic algorithms that find an approximate optimal solution in polynomial time
Summary
I V Kovalev, M V Karaseva , A A Voroshilova and E V Tuev1 1Reshetnev Siberian State Aerospace University 31, Krasnoyarsky Rabochy Av., Krasnoyarsk, Russian Federation 2Siberian State University, 79, Svobodny Av., Krasnoyrsk, Russian Federation 3Krasnoyarsk Science and technology city hall, 61, Uritskogo ave., Krasnoyarsk, 660049, Russian Federation
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
