A Heuristic Procedure for Resource-constrained Project Scheduling |
Common terms and phrases
5-column 7ILEN ACTIVITY IN NSEQ activity number cards algorithm approach BACKUP Balance Network basic activity branch-and-bound algorithm Characteristics for Problem CLOCK Computing Time Results constraints CONT CONTINUE CHECK CONTINUE GO CPLAP Critical Path Method CUNT INUE entry EPST EPST(I Example Network feasible schedule formulation GC TC GO TC heuristic procedures heuristic rules ILIMIT ILIST immediate predecessors immediate successors infeasibilities integer linear programming integer programming integer variables ISAVE iteration latest possible LPST LPST-P m/m/m problem machine MILP mode Network Characteristics Network Diagram nodes NOPS number of activities operations optimal solution overtime Parameters partial ordering PLIST precedence cards precedence violations Problem Set proj project completion project due date project duration project networks project scheduling problems PSP schedule REDUK RESET AVAILABLE resource types Results for Problem RETURN END RTRICT S-LIST scheduling procedure Schrage SDR/CPM SLACK SPAR Stinson's sub-problem SUBROUTINE tardiness tion