Local search methods for the discrete time/resource trade-off problem in project networks

• المؤلفون الرئيسيون: DE REYCK, Bert, DEMEULEMEESTER, Erik, HERROELEN, Willy
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 1998
• الموضوعات: project scheduling; time/resource trade-offs; local search; tabu search; branchand-bound; Business Administration, Management, and Operations; Management Information Systems
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/6743; https://ink.library.smu.edu.sg/context/lkcsb_research/article/7762/viewcontent/_SICI_1520_6750_199809_45_6_553__AID_NAV2_3.0.CO_2_1.pdf
• المؤسسة: Singapore Management University

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single...