A New Approach For the Arrangement of the Resources UnderUndetermined Jobs Sequence

In this paper, a new approach for the time arrangement of the resources and its applications ispresented. If sequence of jobs is neither deterministic nor controllable, then sequencing and schedulingissue will knot to the decision making under conflict and uncertainty that has been addressed in thecontext of sequencing and scheduling models for the first time in here. Models created under theseconditions are named wariness models. In this paper, a general approach is presented for the solutionof such problems and moreover, a pessimistic-based method for solving the problems with the fixedresources arrangement is introduced. Anti-Akers-x algorithm has been propounded to determineidentical job sequences in an n × m environment to maximize Fmax. The wariness models complexity ischecked and then an application example is propounded from the wariness models and it was solvedusing Anti-Akers-x algorithm and the solution obtained was checked by the general method. Finally,Anti-Akers-x algorithm’s validation and verification are tested. It is concluded that: the relatedproblems must be solved by game theory and the presented schedule is able to solve this strongly NPhardproblems correctly and in reasonable time duration.