2007/05/15 by Igor Pesek, Pesek, Igor, Janez Žerovnik +1
Computer Science · Decision Sciences · Engineering · #BIM and Construction Integration #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Resource-Constrained Project Scheduling #Scheduling and Optimization Algorithms #cs.DM
paper · pdf · doi:10.48550/arxiv.0705.2137
8 pages, submitted to conference KOI 2006
arxiv created 2007/05/15 · openalex publication_date 2007/05/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper considers heuristics for well known resource-constrained project scheduling problem (RCPSP). First a feasible schedule is constructed using randomized best insertion algorithm. The construction is followed by a local search where a new solution is generated as follows: first we randomly delete m activities from the list, which are then reinserted in the list in consecutive order. At the end of run, the schedule with the minimum makespan is selected. Experimental work shows very good results on standard test instances found in PSPLIB