A LARGE NUMBER OF IMPORTANT APPLICATIONS ARE REDUCTIBLE TO COMBINATORY MODELS. ALMOST ALL OF THEM ARE AT LEAST EXPONENTIAL COMPLEXITY AND CANNOT BE SALVED IN A TRADITIONAL WAY. IN THE PAPER, WE CONSIDER AN AGENT - BASED APPROACH TO SAOLVE ACLASS OF COMPLEX COMBINATORIAL PROBLEMS IN THE AREA OF PLANNING AND SHEDULING OF BOUNDED RESOURCE ALLOCATION UNDER REAL TIME AND TEMPORAL CONSTRAINTS. THE MODEL OF THE PROBLEM IS FORMULATED IN TERMS OF CONTRACT ALLOCATION OVER A SET OF CONTRACTORS AND SPECIFIED AS AN AUCTION - BASED COMPETITION OF INTELLIGENT AGENTS CONTRACTORS UNDER AGENTMANAGER SUPERVISION. THE PAPER CONTRIBUTIONS ARE REPEATABLE AUCTION - BASED SCHEME OF RANDOM SEARCH OF ADMISSIBLE DECISIONS; KNOWLWDGE BASED SPECIFICATION OF REAL - TIME AND TEMPORAL CONSTRAINS THAT IS USED TO ORDER OF CONTRACT ALLOCATION FROM STEP TO STEP OF AUCTION PROCEDURE; DYNAMIC PROGRAMMING APPROACH FOR FORMING STRATEGY OF BARGAIINING BY AGENT - CONTRACTOR.A LARGE NUMBER OF IMPORTANT APPLICATIONS ARE REDUCTIBLE TO COMBINATORY MODELS. ALMOST ALL OF THEM ARE AT LEAST EXPONENTIAL COMPLEXITY AND CANNOT BE SALVED IN A TRADITIONAL WAY. IN THE PAPER, WE CONSIDER AN AGENT - BASED APPROACH TO SAOLVE ACLASS OF COMPLEX COMBINATORIAL PROBLEMS IN THE AREA OF PLANNING AND SHEDULING OF BOUNDED RESOURCE ALLOCATION UNDER REAL TIME AND TEMPORAL CONSTRAINTS. THE MODEL OF THE PROBLEM IS FORMULATED IN TERMS OF CONTRACT ALLOCATION OVER A SET OF CONTRACTORS AND SPECIFIED AS AN AUCTION - BASED COMPETITION OF INTELLIGENT AGENTS CONTRACTORS UNDER AGENTMANAGER SUPERVISION. THE PAPER CONTRIBUTIONS ARE REPEATABLE AUCTION - BASED SCHEME OF RANDOM SEARCH OF ADMISSIBLE DECISIONS; KNOWLWDGE BASED SPECIFICATION OF REAL - TIME AND TEMPORAL CONSTRAINS THAT IS USED TO ORDER OF CONTRACT ALLOCATION FROM STEP TO STEP OF AUCTION PROCEDURE; DYNAMIC PROGRAMMING APPROACH FOR FORMING STRATEGY OF BARGAIINING BY AGENT - CONTRACTOR.