A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure

Nowadays, organizations are often faced with the development of complex and innovative projects. This type of projects often involves performing tasks which are subject to failure. Thus, in many such projects several possible alternative actions are considered and performed simultaneously. Each alternative is characterized by cost, duration, and probability of technical success. The cost of each alternative is paid at the beginning of the alternative and the project payoff is obtained whenever an alternative has been completed successfully. For this problem one wishes to find the optimal schedule, i.e., the starting time of each alternative, such that the expected net present value is maximized. This problem has been recently proposed in Ranjbar (Int Trans Oper Res 20(2):251–266, 2013), where a branch-and-bound approach is reported. Since the problem is NP-Hard, here we propose to solve the problem using genetic algorithms.

[1]  José Fernando Gonçalves,et al.  A Hybrid Genetic Algorithm for Assembly Line Balancing , 2002, J. Heuristics.

[2]  A. A. Mastor,et al.  An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques , 1970 .

[3]  Mauricio G. C. Resende,et al.  A biased random-key genetic algorithm for the minimization of open stacks problem , 2016, Int. Trans. Oper. Res..

[4]  Mauricio G. C. Resende,et al.  Biased random-key genetic algorithms for combinatorial optimization , 2011, J. Heuristics.

[5]  Bert De Reyck,et al.  Project Planning with Alternative Technologies in Uncertain Environments , 2013, Eur. J. Oper. Res..

[6]  W. Spears,et al.  On the Virtues of Parameterized Uniform Crossover , 1995 .

[7]  Christoph H. Loch,et al.  Selectionism and Learning in Projects with Complexity and Unforeseeable Uncertainty , 2004, Manag. Sci..

[8]  José Fernando Gonçalves,et al.  A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks , 2013, Optim. Lett..

[9]  Ignacio E. Grossmann,et al.  Optimization of industrial scale scheduling problems in new product development , 1998 .

[10]  Roel Leus,et al.  R&D project scheduling when activities may fail , 2007 .

[11]  Stefan Creemers,et al.  R&D project planning with multiple trials in uncertain environments , 2009, 2009 IEEE International Conference on Industrial Engineering and Engineering Management.

[12]  Christos T. Maravelias,et al.  R&D pipeline management: Task interdependencies and risk management , 2011, Eur. J. Oper. Res..

[13]  I. Grossmann,et al.  Simultaneous Planning for New Product Development and Batch Manufacturing Facilities , 2001 .

[14]  Ignacio E. Grossmann,et al.  Optimization Models for the Scheduling of Testing Tasks in New Product Development , 1996 .

[15]  Yael Grushka-Cockayne,et al.  A New Challenge in Project Scheduling: The Incorporation of Activity Failures , 2007 .

[16]  Mauricio G. C. Resende,et al.  A genetic algorithm for the resource constrained multi-project scheduling problem , 2008, Eur. J. Oper. Res..

[17]  Durward K. Sobek,et al.  Toyota's Principles of Set-Based Concurrent Engineering , 1999 .

[18]  Mauricio G. C. Resende,et al.  An evolutionary algorithm for manufacturing cell formation , 2004, Comput. Ind. Eng..

[19]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[20]  S. Creemers,et al.  Project scheduling for maximum NPV with variable activity durations and uncertain activity outcomes , 2008, 2008 IEEE International Conference on Industrial Engineering and Engineering Management.

[21]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[22]  Fernando A. C. C. Fontes,et al.  A hybrid biased random key genetic algorithm approach for the unit commitment problem , 2014, Journal of Combinatorial Optimization.

[23]  Mohammad Ranjbar.  A branch-and-bound algorithm for scheduling of new product development projects , 2013, Int. Trans. Oper. Res..

[24]  J.M. Laínez,et al.  Challenges and opportunities in enterprise-wide optimization in the pharmaceutical industry , 2012, Comput. Chem. Eng..

[25]  Erik Demeulemeester,et al.  RanGen: A Random Network Generator for Activity-on-the-Node Networks , 2003, J. Sched..

[26]  Mauricio G. C. Resende,et al.  A parallel multi-population biased random-key genetic algorithm for a container loading problem , 2012, Comput. Oper. Res..

[27]  Mohammad Ranjbar,et al.  An exact method for scheduling of the alternative technologies in R&D projects , 2013, Comput. Oper. Res..

[28]  Fabrice Talla Nobibon,et al.  Scheduling modular projects on a bottleneck resource , 2014, J. Sched..