In: Journal of Scheduling, 2015, vol. 18, no. 1, p. 89-105
|
In: Algorithmic Operations Research, 2010, vol. 5, p. 75-85
Consider a project which consists in a set of operations to be performed, assuming the processing time of each operation is at most one time period. In this project, precedence and incompatibility constraints between operations have to be satisfied. The goal is to assign a time period to each operation while minimizing the duration of the whole project and while taking into account all the...
|
In: Journal of Heuristics, 2009, vol. 15, no. 5, p. 425-450
|
In: Annals of Operations Research, 2013, vol. 211, no. 1, p. 83-101
|
In: Journal of Scheduling, 2008, vol. 11, no. 4, p. 263-277
|
In: Computational Optimization and Applications, 2012, vol. 51, no. 3, p. 1231-1252
|
In: Bulletin of the School of Oriental and African Studies, 2015, vol. 78, no. 3, p. 646-648
|
