Preface

1. S.M. Baroum and J.H. Patterson, The development of cash flow weight procedures for maximizing the net present value of a project, Journal of Operations Management 14 (1996) 209–227.

   Google Scholar 

2. K. Bouleimen and H. Lecocq, A new efficient simulated annealing algorithm for the resourceconstrained project scheduling problem, in: Proceedings of the Sixth International Workshop on Project Management and Scheduling, eds. G. Barbaros?glu, S. Karabat?, l. Özdamar and G. Ulosoy (B?gaziçi University Printing Office, Istanbul, 1998) pp. 19–22.

   Google Scholar 

3. S. Hartmann, Project scheduling with multiple modes: A genetic algorithm, Technical Report 435, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universitaet Kiel, Kiel, Germany (1997).

   Google Scholar 

4. R. Kolisch and A. Drexl, Local search for nonpreemptive multi-mode resource-constrained project scheduling, IIE Transactions 29 (1997) 987–999.

   Google Scholar 

5. R. Kolisch, A. Sprecher and A. Drexl, PSLIB-A project scheduling problem library, European Journal of Operational Research 96 (1997) 205–216.

   Google Scholar 

6. L. Özdamar, A genetic algorithm approach to a general category project scheduling problem, IEEE Trans. Systems, Man and Cybernetics, Part C: Applications and Reviews 29(1) (1999) 44–59.

   Google Scholar 

Download references