The Scheduling Problem of Renewable Resources Adapted by a Competitive Differential Algorithm

The Scheduling Problem of Renewable Resources Adapted by a Competitive Differential Algorithm
  IJETT-book-cover           
  
© 2024 by IJETT Journal
Volume-72 Issue-12
Year of Publication : 2024
Author : Amol Chaudhary, Sachin Meshram
DOI : 10.14445/22315381/IJETT-V72I12P114

How to Cite?
Amol Chaudhary, Sachin Meshram, "The Scheduling Problem of Renewable Resources Adapted by a Competitive Differential Algorithm," International Journal of Engineering Trends and Technology, vol. 72, no. 12, pp. 151-159, 2024. Crossref, https://doi.org/10.14445/22315381/IJETT-V72I12P114

Abstract
Valuable asset bound project Planning with Inexhaustible assets is a point that has been quite examined. Basically, you have a list of things you need to do in a project, and you have a limited amount of stuff you can use to do those things. There is only one way to do each task, and the resources can be used repeatedly. To address this problem, we used Differential Evolution (DE) to discover first-class work scheduling in an undertaking so that you can reduce the entire mission's final touch time (referred to as the makespan). The number of sources to be had and the duties that may be completed earlier than or after one another (referred to as precedence regulations) should be considered. We used a sequential era method to assemble the challenge schedule and a prioritized fee-driven method to describe it if you want to streamline the procedure. Subsequent, we contrasted our DE set of rules with some different algorithms that had already been created by using other academics. Using Patterson's check bed, we assessed each one and discovered that the DE algorithm finished pretty well, supplying attainable solutions for most problems. This is a remarkable new approach to the problem of RCPSP involving scarce and renewable resources.

Keywords
DE algorithm, RCPSP, Time period optimization, Branch & Bound Approach, Makespan.

References

[1] Sönke Hartmann, and Rainer Kolisch, “Experimental Evaluation of State-of-the-Art Heuristics for the Resource-Constrained Project Scheduling Problem,” European Journal of Operational Research, vol. 127, no. 2, pp. 394-407, 2000.
[CrossRef] [Google Scholar] [Publisher Link]
[2] Rainer Kolisch, and Rema Padman, “An Integrated Survey of Deterministic Project Scheduling,” Omega, vol. 29, no. 3, pp. 249-272, 2001.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Rainer Kolisch, and Sönke Hartmann, “Experimental Investigation of Heuristics for Resource-Constrained Project Scheduling: An Update,” European Journal of Operational Research, vol. 174, no. 1, pp. 23-37, 2006.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Sönke Hartmann, “A Competitive Genetic Algorithm for Resource‐Constrained Project Scheduling,” Naval Research Logistics (NRL), vol. 45, no. 7, pp. 733-750, 1998.
[CrossRef] [Google Scholar] [Publisher Link]
[5] Sönke Hartmann, “A Self‐Adapting Genetic Algorithm for Project Scheduling Under Resource Constraints,” Naval Research Logistics (NRL), vol. 49, no. 5, pp. 433-448, 2002.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Kwan Woo Kim, Mitsuo Gen, and Genji Yamazaki, “Hybrid Genetic Algorithm with Fuzzy Logic for Resource-Constrained Project Scheduling,” Applied Soft Computing, vol. 2, no. 3, pp. 174-188, 2003.
[CrossRef] [Google Scholar] [Publisher Link]
[7] U. Kohlmorgen, H. Schmeck, and K. Haase, “Experiences with Fine‐Grainedparallel Genetic Algorithms,” Annals of Operations Research, vol. 90, pp. 203-219, 1999.
[CrossRef] [Google Scholar] [Publisher Link]
[8] Jae-Kwan Lee, and Yeong-Dae Kim, “Search Heuristics for Resource Constrained Project Scheduling,” Journal of the Operational Research Society, vol. 47, no. 5, pp. 678-689, 1996.
[CrossRef] [Google Scholar] [Publisher Link]
[9] V. Jorge Leon, and Ramamoorthy Balakrishnan, “Strength and Adaptability of Problem-Space Based Neighborhoods for Resource-Constrained Scheduling,” Operations-Research-Spektrum, vol. 17, pp. 173-182, 1995.
[CrossRef] [Google Scholar] [Publisher Link]
[10] Jorge Magalhães-Mendes, Jose F. Gonçalves, and Maurício G. C. Resende, “A Random Key Based Genetic Algorithm for the Resource Constrained Project Scheduling Problem,” Computers and Operations Research, vol. 36, no. 1, pp. 92-109, 2009.
[CrossRef] [Google Scholar] [Publisher Link]
[11] Vicente Valls, Francisco Ballestín, and Sacramento Quintanilla, “A Hybrid Genetic Algorithm for the Resource-Constrained Project Scheduling Problem,” European Journal of Operational Research, vol. 185, no. 2, pp. 495-508, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[12] Reza Zamani, “A Competitive Magnet-Based Genetic Algorithm for Solving the Resource-Constrained Project Scheduling Problem,” European Journal of Operational Research, vol. 229, no. 2, pp. 552-559, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[13] Kamel Bouleimen, and H. Lecocq, “A New Efficient Simulated Annealing Algorithm for the Resource-Constrained Project Scheduling Problem and its Multiple Mode Version,” European Journal of Operational Research, vol. 149, no. 2, pp. 268-281, 2003.
[CrossRef] [Google Scholar] [Publisher Link]
[14] Fayez Fouad Boctor, An Adaptation of the Simulated Annealing Algorithm for Solving Resource-Constrained Project Scheduling Problems, Laval University, Research Directorate, Faculty of Administration, 1994.
[Google Scholar] [Publisher Link]
[15] Daniel Merkle, Martin Middendorf, and Hartmut Schmeck, “Ant Colony Optimization for Resource-Constrained Project Scheduling,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 333-346, 2002.
[CrossRef] [Google Scholar] [Publisher Link]
[16] Shih-Tang Lo et al., “Multiprocessor System Scheduling with Precedence and Resource Constraints Using an Enhanced ant Colony System,” Expert Systems with Applications, vol. 34, no. 3, pp. 2071-2081, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[17] Hong Zhang, Heng Li, and C. M. Tam, “Particle Swarm Optimization for Resource-Constrained Project Scheduling,” International Journal of Project Management, vol. 24, no. 1, pp. 83-92, 2006.
[CrossRef] [Google Scholar] [Publisher Link]
[18] Qiong Jia and Yoonho Seo, “Solving Resource-Constrained Project Scheduling Problems: Conceptual Validation of FLP Formulation and Efficient Permutation-Based ABC Computation,” Computers & Operations Research, vol. 40, no. 8, pp. 2037-2050, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[19] Rainer Storn, and Kenneth Price, “Differential Evolution - A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces,” Journal of Global Optimization, vol. 11, pp. 341-359, 1997.
[CrossRef] [Google Scholar] [Publisher Link]
[20] Najeh Damak et al., “Differential Evolution for Solving Multi-Mode Resource-Constrained Project Scheduling Problems,” Computers and Operations Research, vol. 36, no. 9, pp. 2653-2659, 2009.
[CrossRef] [Google Scholar] [Publisher Link]
[21] Jarboui Bassem et al., “A Combinatorial Particle Swarm Optimization for Solving Multi-Mode Resource-Constrained Project Scheduling Problems,” Applied Mathematics and Computation, vol. 195, no. 1, pp. 299-308, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[22] Amir Rahimi, Hamid Karimi, and Behrouz Afshar-Nadjafi, “Using Meta-Heuristics for Project Scheduling under Mode Identity Constraints,” Applied Soft Computing, vol. 13, no. 4, pp. 2124-2135, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[23] Jacek Blazewicz, Jan Karel Lenstra, and Alexander H. G. Rinnooy Kan, “Scheduling Subject to Resource Constraints: Classification and Complexity,” Discrete Applied Mathematics, vol. 5, no. 1, pp. 11-24, 1983.
[CrossRef] [Google Scholar] [Publisher Link]