IJE TRANSACTIONS C: Aspects Vol. 28, No. 6 (June 2015) 896-902    Article in Press

downloaded Downloaded: 205   viewed Viewed: 2536

N. Zoraghi, A. A. Najafi and S. T. A. Niaki
( Received: April 08, 2014 – Accepted: September 18, 2014 )

Abstract    Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material ordering problem is first formulated into a NP-hard optimization model. Then, two hybridized meta-heuristic algorithms are proposed to solve the integrated problem. In addition, statistical methods are employed to tune the parameters of both algorithms. Finally, computational results for a set of test problems taken from the project scheduling problem library (PSPLIB) are presented.


Keywords    Project scheduling, Material ordering, Resource constraint, Hybrid meta-heuristic algorithm, Taguchi design


چکیده    مسئله زمانبندي پروژه با محدوديت منابع (RCPSP) اساساً به بررسي يكي از اهداف كمينه سازي زمان اتمام پروژه و يا بيشينه سازي ارزش خالص فعلي پروژه ميپردازد. بنابراين مدلهاي موجود زماني كه برنامه ريزي مواد نقشي كليدي در يك پروژه را ايفا مي كنند، قادر به تعيين برنامه سفارش دهي مواد براي كمينه سازي هزينه ها نيستند. در اين مقاله، ابتدا مسئله (RCPSP) با مسئله سفارش دهي مواد در قالب يك مدل بهينه سازي NP-Hard تركيب مي‌شود. سپس، دو الگوريتم فراابتكاري تركيبي براي حل مسئله ادغام شده پيشنهاد مي‌شود. علاوه براين، روش هاي آماري نيز براي تنظيم پارامترهاي هر دو الگوريتم به كارگرفته مي‌شوند. در نهايت، نتايج محاسباتي براي مجموعه‌اي از مسائل نمونه، برگرفته از كتابخانه مسائل زمانبندي پروژه (PSPLIB) ارائه مي‌شوند.



1.     Aquilano, N.J., Smith-Daniels, D.E. "A formal set of algorithms for project scheduling with critical path method material requirements planning", Journal of Operations Management, Vol. 1, (1980), 57-67.

2.     Smith-Daniels, D.E., Aquilano, N.J. "Constrained resource project scheduling subject to material constraints", Journal of Operations Management, Vol. 4, (1984), 369-388.

3.     Smith-Daniels, D.E., Smith-Daniels, V.L. "Maximizing the net present value of a project subject to material and capital constraint", Journal of Operations Management, Vol. 7, (1987), 33-44.

4.     Dodin, B., Elimam, A.A. "Integrated project scheduling and material planning with variable activity duration and rewards", IIE Transactions, Vol. 33, (2001), 1005-1018.

5.     Sajadieh, M.S., Shadrokh, S., Hassanzadeh, F. "Concurrent project scheduling and material planning: A genetic algorithm approach", Scientia Iranica Transactions E: Industrial Engineering, Vol. 16, (2009), 91-99.

6.     Najafi, A.A., Zoraghi, N., Azimi, F. "Scheduling a project to minimize costs of material requirements", World Academy of Science, Engineering and Technology, Vol. 78, (2011), 134-137.

7.     Blazewicz, J., Lenstra, J., Kan, A.R. "Scheduling subject to resource constraints: Classification and complexity", Discrete Applied Mathematics, Vol. 5, (1983), 1124.

8.     Kolisch, R., Hartmann, S. "Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis", In:Weglarz J (ed) Project scheduling recent models, algorithms and applications. Kluwer Academic, Boston (1999) 147178.

Shittu, E. "Applying genetic algorithms to the deterministic time-varying fixed quantity lot sizing problem", Master's Thesis. The American University in Cairo, Egypt (2003)

International Journal of Engineering
E-mail: office@ije.ir
Web Site: http://www.ije.ir