AUB ScholarWorks

Solving the resource-constrained project scheduling problem by a variable neighbourhood search

Show simple item record Fleszar K. Hindi K.S.
dc.contributor.editor 2004 2017-09-07T07:51:26Z 2017-09-07T07:51:26Z 2004
dc.identifier 10.1016/S0377-2217(02)00884-6
dc.identifier.issn 03772217
dc.description.abstract The well-known, challenging problem of resource-constrained project scheduling is addressed. A solution scheme based on variable neighbourhood search is presented. The solution is coded by using activity sequences that are valid in terms of precedence constraints. The sequences are turned into valid active schedules through a serial scheduler. The search of the solution space is carried out via generating valid sequences using two types of move strategy. Much of the power of the solution scheme is attributable to repeatedly employing effective lower bounding and precedence augmentation, both of which serve to reduce the solution space. The effectiveness of the solution scheme is demonstrated through extensive experimentation with a standard set of 2040 benchmark problem instances. The best-known solutions have been improved upon for 48 instances and the best-known lower bounds have also been improved upon for 148 problem instances. The results are inferior to the best-known for a relatively small number of problem instances, but even then the average deviation is very small indeed. © 2003 Published by Elsevier B.V.
dc.format.extent Pages: (402-413)
dc.language English
dc.publisher AMSTERDAM
dc.relation.ispartof Publication Name: European Journal of Operational Research; Publication Year: 2004; Volume: 155; no. 2; Pages: (402-413);
dc.source Scopus
dc.title Solving the resource-constrained project scheduling problem by a variable neighbourhood search
dc.type Article
dc.contributor.affiliation Fleszar, K., Inst. of Contr.-Comp. Engineering, Warsaw University of Technology, ul. Nowowiejska 15-19, 00-665 Warszawa, Poland
dc.contributor.affiliation Hindi, K.S., Fac. of Engineering and Architecture, School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon
dc.contributor.authorAddress Hindi, K.S.; Fac. of Engineering and Architecture, School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon; email:
dc.contributor.authorCorporate University: American University of Beirut; Faculty: Suliman S. Olayan School of Business; Department: School of Business;
dc.contributor.authorDepartment School of Business
dc.contributor.faculty Suliman S. Olayan School of Business
dc.contributor.authorInitials Fleszar, K
dc.contributor.authorInitials Hindi, KS
dc.contributor.authorOrcidID Fleszar, Krzysztof-0000-0001-8863-6756
dc.contributor.authorReprintAddress Hindi, KS (reprint author), Warsaw Univ Technol, Inst Control and Computat Engn, Ul Nowowiejska 15-19, PL-00665 Warsaw, Poland.
dc.contributor.authorResearcherID Fleszar, Krzysztof-B-8260-2012
dc.contributor.authorUniversity American University of Beirut
dc.description.cited Alvarez-Valdes R., 1989, ADV PROJECT SCHEDULI; BLAZEWICZ J, 1983, DISCRETE APPL MATH, V5, P11, DOI 10.1016-0166-218X(83)90012-4; Brucker P, 1999, EUR J OPER RES, V112, P3, DOI 10.1016-S0377-2217(98)00204-5; DAVIS EW, 1975, MANAGE SCI B-APPL, V21, P944, DOI 10.1287-mnsc.21.8.944; ELMAGHRABI S, 1977, ACTIVITY NETWORKS PR; Hansen P., 1999, ADV TRENDS LOCAL SEA, P433; Hartmann S, 1998, NAV RES LOG, V45, P733, DOI 10.1002-(SICI)1520-6750(199810)45:7733::AID-NAV53.3.CO;2-7; Hartmann S, 2000, EUR J OPER RES, V127, P394, DOI 10.1016-S0377-2217(99)00485-3; Herroelen W, 1998, COMPUT OPER RES, V25, P279, DOI 10.1016-S0305-0548(97)00055-5; HERROELEN W, 1999, PROJECT SCHEDULING R; KIM YD, 1995, COMPUT OPER RES, V22, P307; Klein R, 1999, EUR J OPER RES, V112, P322, DOI 10.1016-S0377-2217(97)00442-6; Kolisch R., 1999, PROJECT SCHEDULING R; Kolisch R, 1996, EUR J OPER RES, V90, P320, DOI 10.1016-0377-2217(95)00357-6; Kolisch R, 1997, EUR J OPER RES, V96, P205, DOI 10.1016-S0377-2217(96)00170-1; Kolisch R, 1995, PHYSICA; Mladenovic N, 1997, COMPUT OPER RES, V24, P1097, DOI 10.1016-S0305-0548(97)00031-2; Naphade KS, 1997, ANN OPER RES, V70, P307, DOI 10.1023-A:1018982423325; PATTERSON JH, 1984, MANAGE SCI, V30, P854, DOI 10.1287-mnsc.30.7.854; PRITSKER AAB, 1969, MANAGE SCI, V16, P93, DOI 10.1287-mnsc.16.1.93; SPRECHER A, 1995, EUR J OPER RES, V80, P94, DOI 10.1016-0377-2217(93)E0294-8; Weglarz J, 1999, PROJECT SCHEDULING R
dc.description.citedCount 76
dc.description.citedTotWOSCount 63
dc.description.citedWOSCount 55
dc.format.extentCount 12
dc.identifier.coden EJORD
dc.identifier.scopusID 1642436954
dc.publisher.address PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
dc.relation.ispartOfISOAbbr Eur. J. Oper. Res.
dc.relation.ispartOfIssue 2
dc.relation.ispartofPubTitle European Journal of Operational Research
dc.relation.ispartofPubTitleAbbr Eur J Oper Res
dc.relation.ispartOfVolume 155
dc.source.ID WOS:000188977300012
dc.type.publication Journal
dc.subject.otherAuthKeyword Heuristics
dc.subject.otherAuthKeyword Scheduling
dc.subject.otherAuthKeyword Variable neighbourhood search
dc.subject.otherIndex Benchmarking
dc.subject.otherIndex Computational complexity
dc.subject.otherIndex Constraint theory
dc.subject.otherIndex Heuristic methods
dc.subject.otherIndex Problem solving
dc.subject.otherIndex Set theory
dc.subject.otherIndex Resource-constrained project scheduling problem (RCPSP)
dc.subject.otherIndex Variable neighbourhood search
dc.subject.otherIndex Scheduling
dc.subject.otherKeywordPlus CLASSIFICATION
dc.subject.otherKeywordPlus ALGORITHMS
dc.subject.otherWOS Management
dc.subject.otherWOS Operations Research and Management Science

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search AUB ScholarWorks


My Account