Abstract

A survey of project scheduling problems since 1973 limited to work done specifically in the project scheduling area (although several techniques developed for assembly line balancing and job‐shop scheduling can be applicable to project scheduling): the survey includes the work done on fundamental problems such as the resource‐constrained project scheduling problem (RCPSP); time/cost trade‐off problem (TCTP); and payment scheduling problem (PSP). Also discusses some recent research that integrates RCPSP with either TCTP or PSP, and PSP with TCTP. In spite of their practical relevance, very little work has been done on these combined problems to date. The future of the project scheduling literature appears to be developing in the direction of combining the fundamental problems and developing efficient exact and heuristic methods for the resulting problems.

Full Text
Paper version not known

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

Disclaimer: 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.