Abstract
Purpose – This paper aims to present a new method to circumvent the limitations of current schedule compression methods which reduce schedule crashing to the traditional time-cost trade-off analysis, where only cost is considered. Design/methodology/approach – The schedule compression process is modeled as a multi-attributed decision making problem in which different factors contribute to priority setting for activity crashing. For this purpose, a modified format of the Multiple Binary Decision Method (MBDM) along with iterative crashing process is utilized. The method is implemented in MATLAB, with a dynamic link to MS-Project to facilitate the needed iterative rescheduling. To demonstrate the use of the developed method and to present its capabilities, a numerical example drawn from literature was analysed. Findings – When considering cost only, the generated results were in good agreement with those generated using the harmony search (HS) method, particularly in capturing the project least-cost duratio...
Sign-in/Register to access full text options 
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.
