New computational results for the discrete time/cost trade-off problem with time-switch constraints
Vanhoucke, Mario
Vanhoucke, Mario
Citations
Altmetric:
Publication Type
Journal article with impact factor
Editor
Supervisor
Publication Year
2005-09
Journal
European Journal of Operational Research
Book
Publication Volume
165
Publication Issue
2
Publication Begin page
359
Publication End page
374
Publication Number of pages
Collections
Abstract
Recently, time-switch constraints have been introduced in the literature by Yang and Chen [Eur. J. Operat. Res. 120 (2000) 603]. Basically, these constraints impose a specified starting time on the project activities and force them to be inactive during specified time periods. This type of constraints have been incorporated into the well-known discrete time/cost trade-off problem in order to cope with day, night and weekend shifts.In this paper, we propose a new branch-and-bound algorithm which outperforms the previous one by Vanhoucke et al. [J. Operat. Res. Soc. 53 (2002) 1]. The procedure makes use of a lower bound calculation for the discrete time/cost trade-off problem (without time-switch constraints). The procedure has been coded in Visual C++, version 6.0 under Windows 2000 and has been validated on a randomly generated problem set.
Research Projects
Organizational Units
Journal Issue
Keywords
4901 Applied Mathematics, 40 Engineering, 49 Mathematical Sciences