Using meta-heuristics for project scheduling under mode identity constraints

Applied Soft Computing Journal

Volumn 13, Issue 4, 2013, Pages 2124-2135

  Rahimi, Amir ^a   Karimi, Hamid ^a   Afshar Nadjafi, Behrouz ^a  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

Differential evolution; Imperialist competitive algorithm; Mode identity; Project scheduling; Simulated annealing

Indexed keywords

COMPUTATIONAL EFFICIENCY; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; OPTIMIZATION; SCHEDULING; SIMULATED ANNEALING;

COMPUTATIONAL RESULTS; DIFFERENTIAL EVOLUTION; IMPERIALIST COMPETITIVE ALGORITHMS; META HEURISTIC ALGORITHM; MODE IDENTITY; PROJECT SCHEDULING; PROJECT SCHEDULING PROBLEM; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM;

EVOLUTIONARY ALGORITHMS;

EID: 84890443005     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2012.11.002     Document Type: Article

References (35)

1. A. Drexl, J. Juretzka, F. Salewski, A. Schirmer, New modeling concepts and their impact on resource-constrained project scheduling, in: J. Weglarz (Ed.), Project Scheduling - Recent Models, Algorithms and Applications, Kluwer Academic Publishers, Boston, 1998, pp. 413-432.
2. F. Salewski, A. Schirmer, A. Drexl, Project scheduling under resource and mode identity constraints, European Journal of Operational Research 102 (1997) 88-110.
3. B. Afshar-Nadjafi, A. Rahimi, An exact solution procedure for mode identity and resource constrained project scheduling problem, in: N. Mastorakis, V. Mladenov, M. Demiralp, Z. Bojković (Eds.), Recent Researches in Applied Mathematics, WSEAS Press, Athens, 2010, pp. 20-26.
4. L. Ozdamar, A genetic algorithm approach to a general category project scheduling problem, IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications and Reviews 29 (1) (1999) 44-59.
5. S. Hartmann, Project scheduling with multiple modes: a genetic algorithm, Annals of Operations Research 102 (1-4) (2001) 111-135.
6. J. Alcaraz, C. Maroto, R. Ruiz, Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms, Journal of the Operational Research Society 54 (6) (2003) 614-626.
7. S. Elloumi, P. Fortemps, J. Teghem, T. Loukil, A new bi-objective algorithm using clustering heuristics to solve the multi-mode resource-constrained project scheduling problem, in: Proceedings of the 25th Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG 2006), Nottingham, UK, 2006, pp. 113-120.
8. A. Lova, P. Tormos, M. Cervantes, F. Barber, An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes, International Journal of Production Economics 117 (2) (2009) 302-316.
9. K. Bouleimen, H. Lecocq, A new ef.cient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version, European Journal of Operational Research 149 (2003) 268-281.
10. B. Jarboui, N. Damak, P. Siarry, A. Rebai, A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems, Applied Mathematics and Computation 195 (1) (2008) 299-308.
11. J. Damak, B. Jarboui, P. Siarry, T. Loukil, Differential evolution for solving multi-mode resource-constrained project scheduling problems, Computers & Operations Research 36 (2009) 2653-2659.
12. M. Ranjbar, B. De Reyck, F. Kianfar, A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling, European Journal of Operational Research 193 (1) (2009) 35-48.
13. J. Wȩglarz, J. Józefowska, M. Mika, G. Waligóra, Project scheduling with finite or infinite number of activity processing modes - a survey, European Journal of Operational Research 208 (2011) 177-205.
14. E. Demeulemeester, W. Herroelen, Project Scheduling: a Research Handbook, Kluwer Academic Publishers, Boston, 2002.
15. A. Sprecher, S. Hartmann, A. Drexl, An exact algorithm for project scheduling with multiple modes, OR Spektrum 19 (1997) 195-203.
16. E. Atashpaz-Gargari, C. Lucas, Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialist Competitive, IEEE Congress on Evolutionary Computation, Singapore, 2007.
17. J. Behnamian, M. Zandieh, A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties, Expert Systems with Applications (2011), http://dx.doi.org/10.1016/j. eswa.2011.04.241.
18. M. Bagher, M. Zandieh, H. Farsijani, Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm, International Journal of Advanced Manufacturing Technology (2010), http://dx.doi.org/10.1007/s00170-010- 2937-3.
19. C. Lucas, Z. Nasiri-Gheidari, F. Tootoonchian, Application of an imperialist competitive algorithm to the design of a linear induction motor, Energy Conversion and Management 51 (2010) 1407-1411.
20. N.B. Ho, J.C. Tay, E.M.K. Lai, An effective architecture for learning and evolving flexible job-shop schedules, European Journal of Operational Research 179 (2) (2007) 316-333.
21. L.N. Xing, Y.W. Chen, P. Wang, Q.S. Zhao, J. Xiong, A knowledge-based ant colony optimization for flexible job shop scheduling problems, Applied Soft Computing 10 (2010) 888-896.
22. R. Storn, K. Price, Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization 11 (1997) 341-354.
23. F.S. Al-Anzi, A. Allahverdi, A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times, European Journal of Operational Research 182 (2007) 80-94.
24. A.R. Boloori Arabani, S.M.T. Fatemi Ghomi, M. Zandieh, Meta-heuristics implementation for scheduling of trucks in a cross-docking system with temporary storage, Expert Systems with Applications 38 (2010) 1964-1979.
25. L.L. Lorenzoni, H. Ahonen, A.G. Alvarenga, A multi-mode resource-constrained scheduling problem in the context of port operations, Computers & Industrial Engineering 50 (2006) 55-56.
26. A. Nourmohammadi, M. Zandieh, Assembly line balancing by a new multi-objective differential evolution algorithm based on TOPSIS, International Journal of Production Research 49 (2011) 2833-2855.
27. S. Kirkpatrick, C. Gelatt, M. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
28. B. Abbasi, S. Shadrokh, J. Arkat, Bi-objective resource-constrained project scheduling with robustness and makespan criteria, Journal Applied Mathematics and Computation 180 (2006) 146-152.
29. F.F. Boctor, Resource-constrained project scheduling by simulated annealing, International Journal of Production Research 34 (1996) 2335-2351.
30. Z. He, N. Wang, T. Jia, Y. Xu, Simulated annealing and tabu search for multimode project payment scheduling, European Journal of Operational Research 198 (2009) 688-696.
31. J. Józefowska, M. Mika, R. Rózycki, G. Waligóra, J. Weglarz, Simulated annealing for multi-mode resource-constrained project scheduling, Annals of Operations Research 102 (2001) 137-155.
32. M. Mika, G. Waligóra, J. Weglarz, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, European Journal of Operational Research 164 (2005) 639-668.
33. A. Shtub, L.J. LeBlanc, Z. Cai, Scheduling programs with repetitive projects: a comparison of a simulated annealing, a genetic and a pair-wise swap algorithm, European Journal of Operational Research 88 (1996) 124-138.
34. M. Lundy, A. Mees, Convergence of an annealing algorithm, Mathematical Programming 34 (1986) 111-124.
35. A. Drexl, R. Nissen, J.H. Patterson, F. Salewski, ProGen/πx - an instance generator for resource constrained project scheduling problems with partially renewable resources and further extensions, European Journal of Operational Research 125 (2000) 59-72.