Abstract:
The most important condition in the scheduling of the project activity is keeping the set time limits, which are linked to periodic intervals of work time. Classic JSSP (Job Shop Scheduling Problem) tasking did not pay enough attention to periodic intervals schedules of most organizations and enterprises. Formulation and solution of the planning problem presented in this article involves the introduction of a minimum length of time that allows the flexibility to describe the structure of periodic time constraints. The article deals with the time shift algorithm used to obtain a precise schedule in terms of periodic time intervals. Solution of this problem involves two steps: the first step is to set up a continuous schedule (Gantt chart), the second comprises its subsequent periodic adjustment to the time constraints of an arbitrary shape. The second step is used to solve the problem of shift algorithm, the computational complexity of which depends on the minimum amount of time and its dimension (duration of the project). Algorithm testing within the model-algorithmic complex on the graphs shows insignificant increase in computational complexity with a significant increase in the volume of initial data. Thus, the algorithm has a data application prospects in large-scale industrial systems of scheduling. The considered problem of scheduling is urgent for companies and organizations involved in developing and implementing the projects, IT service providers, etc. The submitted mechanisms and techniques can be used in the development of planning subsystems in various branches of science and technology (production, transportation, design-process activities).
Keywords:labeling, schedule, IT-service, job shop schedule, time constraints, service management.