Abstract
The paper presents the resource-constrained project scheduling problem with the makespan minimisation criterion. To solve the problem, the authors propose insertion algorithms which generate schedules with use of forward serial and parallel decoding procedures. Schedules are improved with the use of the double justification by extremes technique (first right and then left justification). The efficiency of the procedures proposed is tested on standard test problems from the PSPLIB library.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
