Abstract
The discrete time/cost trade-off problem (DTCTP) is commonly encountered in repetitive project scheduling. The current models for this problem assume that logical sequences of activities cannot be changed in different units. However, logical sequences are often changed to shorten the project time and minimize project total cost in many practical situations. This characteristic of repetitive activities is referred to as the soft logic. This paper presents a mixed integer nonlinear programming model that combines the general DTCTP and the concept of soft logic. The execution modes of an activity in different units are also considered. The DTCTP is known to be strongly NP-hard, and the introduction of soft logic makes it even more complex. A genetic algorithm (GA) is proposed to resolve the problem. The effectiveness of the proposed GA is verified using the example of a bridge construction project presented in the previous literature. The model proposed in this paper provides more flexibility to reduce the total cost and time of a repetitive project for the planners.
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 callMore From: Journal of Industrial & Management Optimization
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.
