Work item visual scheduling management method and system based on dynamic row allocation

Abstract

The invention discloses a work item visual scheduling management method and system based on dynamic row allocation. The method comprises the steps of initializing, sorting all work items according to the minimum starting time, determining a global date range, creating a mapping table to record a row number set occupied by each date, and setting a billboard starting date reference value. Scheduling calculation is carried out, the ordered work item queue is traversed, the task scheduling of each work item is analyzed, a continuous date sequence is generated, the mapping table is inquired to obtain a line number set occupied by each date, the distributable minimum available line number is calculated, the mapping table is updated, and the horizontal offset and the vertical offset are calculated. And visual rendering: rendering all the work item scheduling blocks in a non-overlapping manner, and ensuring that different scheduling blocks of the same work item are horizontally and continuously arranged. Through a dynamic line number distribution algorithm, the occupation of a screen space is greatly reduced, so that more work items can be displayed in a limited screen height, and the information density of a single screen is improved.

Description

Technical Field

[0001] The present invention belongs to the technical field of project management and relates to a method and system for visual scheduling management of work items based on dynamic row allocation. Background Art

[0002] In the field of project management, the registration, decomposition, and scheduling of work items are key links to ensure the smooth progress of a project. However, in actual operation, project managers often face a series of challenges, especially when dealing with a large number of work items and complex scheduling.

[0003] First of all, the registration of work items often spans multiple days, which means that a work item may involve multiple dates. When registering a work item with a large task volume, in order to manage and execute it more effectively, project managers usually need to decompose this task into multiple small tasks or sub-work items. This decomposition helps to clarify responsibilities, allocate resources, and monitor progress. However, in the process of project management, the emergence of urgent needs is inevitable. When these urgent needs need to be inserted into the originally scheduled work item schedule, it will lead to discontinuity of the schedule. Traditionally, project managers would reserve a separate row for each work item on the kanban for display to facilitate tracking and management. However, when the number of work items increases and the scheduling becomes complex, this method will cause the canvas height occupied by the kanban to be too long, making it impossible to view all work items at once within the limited screen space.

[0004] In addition, due to the discontinuity of work item scheduling, there are often a large number of blank areas on the kanban. These blank areas not only waste valuable display space but also affect the overall aesthetics and information density of the kanban. More importantly, it makes it difficult for project managers to grasp the overall work progress, thus affecting the smooth progress of the project.

[0005] To solve these problems, project managers need a method or system that can automatically adjust and optimize the kanban layout. This method or system should be able to compress the blank areas to make the kanban layout more compact; at the same time, it should also ensure that work items do not overlap and that multiple schedules of the same work item can be displayed on the same row. However, in the existing technologies, there is no solution that can effectively solve these problems. Therefore, the present invention proposes a method and system for visual scheduling management of work items based on dynamic row allocation, aiming to solve the above technical problems and improve project management efficiency and visualization effect. Summary of the Invention

[0006] The purpose of the present invention is to solve the problem in the prior art that when the number of work items increases and the scheduling becomes complex, it is impossible to view all work items at once within the limited screen space, and to provide a method and system for visual scheduling management of work items based on dynamic row allocation.

[0007] To achieve the above object, the present invention is implemented by the following technical solutions: A work item visualization scheduling management method based on dynamic row allocation, comprising the following steps: Initialization stage: a. Sort all work items by the earliest start time to generate an ordered work item queue; b. Determine the global date range according to the start and end dates of all work items, including the earliest start date and the latest end date; c. Create a date-row number mapping table, and use the data structure Map<date, Set<row number>> to record the set of row numbers occupied by each date. When initializing, the set of row numbers corresponding to each date is empty; d. Set the starting date reference value of the kanban to calculate the horizontal offset of subsequent task blocks; Scheduling calculation stage: a. Traverse the ordered work item queue and perform the following operations on each work item: b. Parse all task schedules of the work item to generate a corresponding continuous date sequence; c. Query the date-row number mapping table to obtain the set of occupied row numbers for each date in the date sequence; d. Calculate the smallest available row number that can be allocated for the date sequence through a recursive algorithm, ensuring that this row number is not occupied in all relevant dates; e. Update the smallest available row number to the set of row numbers corresponding to the corresponding date in the date-row number mapping table; calculate the horizontal offset based on the starting date reference value and the task start date, and calculate the vertical offset by combining the smallest available row number and the row height parameter; Visualization rendering stage: According to the horizontal and vertical offsets of each task block, render all work item schedule blocks on a two-dimensional canvas in a non-overlapping manner, and keep the different schedule blocks of the same work item in a horizontally continuous layout.

[0008] The method for determining the global date range further includes a dynamic expansion mechanism: When it is detected that the start / end date of a newly added work item exceeds the current global date range, automatically expand the date coverage range of the date-row number mapping table, recalculate the horizontal offsets of all task blocks, and trigger a visual re-rendering.

[0009] The recursive algorithm in the scheduling calculation stage is specifically: Start detecting row by row from row 0 to check whether it meets the condition that for all dates in the date sequence, the currently detected row number is not included in the date-row number mapping table; Immediately terminate the recursion and return the line number when the first line number that meets the conditions is detected.

[0010] The specific calculation method of the horizontal offset is as follows: Horizontal offset = (Task start date - Starting date reference value) × Pixel width per day.

[0011] The specific calculation method of the vertical offset is as follows: Vertical offset = Minimum available line number × Pixel height per line.

[0012] The rendering process further includes: Using the same color coding for different scheduling blocks of the same work item; Generating continuous rectangular blocks for visual representation when there is cross-day scheduling.

[0013] The method further includes a conflict handling mechanism: When it is detected that the scheduling blocks of two work items overlap on the same date and line number, re-execute the step recursion algorithm for the later inserted work item to allocate a new line number, generate a visual warning identifier, and record the scheduling conflict log.

[0014] A work item visual scheduling management system based on dynamic line allocation, including the following modules: A work item sorting module, used to sort all work items according to the minimum start time of the work items; A date range determination module, used to determine the earliest start date and the latest end date of all work items; A date occupancy mapping table initialization module, used to initialize the date occupancy mapping table; A task block data generation module, used to traverse each sorted work item and generate task block data including date, line number, horizontal offset, and vertical offset; A kanban rendering module, used to render a compact work item kanban layout on the visual interface according to the task block data.

[0015] A device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, it implements the steps of the method described in any one of the previous items.

[0016] A computer-readable storage medium, the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, it implements the steps of the method described in any one of the previous items.

[0017] Compared with the prior art, the present invention has the following beneficial effects: Significantly improve space utilization and visualization efficiency: Through the dynamic line number allocation algorithm, the occupation of screen space is greatly reduced, enabling more work items to be displayed within the limited screen height, thus increasing the information density per screen. The redundant blank areas between date columns are eliminated, and the blank area of the canvas is reduced, making information display more compact and efficient. It supports dynamically expanding the line number capacity according to newly added tasks, reducing the frequency of user scrolling operations and further enhancing visualization efficiency.

[0018] Enhance the overall progress control ability: Through timeline alignment and line number stacking layout, the concurrent execution status of multiple tasks is intuitively presented, improving the identification efficiency of the project's critical path. The overloaded resource time periods are exposed in real time, shortening the discovery and response time of resource conflicts, so that resource allocation and conflict resolution can be carried out more promptly. The visual coherence of the internal logic of tasks is maintained, reducing the misjudgment rate of task dependencies and helping to more accurately grasp the project progress.

[0019] Breakthrough improvement in human-computer interaction efficiency: By replacing manual layout operations with automated algorithms, the cognitive load of users is reduced, and the layout adjustment time is saved. Real-time coordinate calculation and flicker-free rendering optimize the dynamic response, making the interaction response delay meet the human instantaneous visual memory threshold and enhancing the user experience. Provide view selections with multi-granularity adaptation, making it more efficient to find information on key time nodes. Description of the Drawings

[0020] To more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as limiting the scope. For those of ordinary skill in the art, without creative efforts, other related drawings can also be obtained based on these drawings.

[0021] Figure 1 It is a flowchart of the work item visualization scheduling management method based on dynamic line allocation of the present invention; Figure 2 It is the rendering effect diagram of the present invention. Detailed Embodiments

[0022] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. Usually, the components of the embodiments of the present invention described and shown in the drawings here can be arranged and designed in various different configurations.

[0023] Accordingly, the following detailed description of the embodiments of the present invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely represents selected embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the scope of protection of the present invention.

[0024] It should be noted that like reference numerals and letters denote like items in the following drawings, and thus, once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings.

[0025] The present invention will be further described in detail below with reference to the accompanying drawings: See Figure 1 , which is a flowchart of the work item visualization scheduling management method based on dynamic row allocation of the present invention, mainly including an initialization stage, a scheduling calculation stage, and a visualization rendering stage. In the initialization stage, first, all work items are sorted by the minimum start time, the global date range is determined, and a date-row number mapping table is created to record the set of row numbers occupied by each date. At the same time, the starting date reference value of the kanban is set. Entering the scheduling calculation stage, traverse the ordered work item queue, parse the task schedule for each work item, generate a continuous date sequence, and query the date-row number mapping table to obtain the set of occupied row numbers for each date. Calculate the minimum available row number that can be allocated through a recursive algorithm and update the mapping table. At the same time, calculate the horizontal offset based on the starting date reference value and the task start date, and calculate the vertical offset by combining the minimum available row number and the row height parameter. Finally, in the visualization rendering stage, according to the horizontal and vertical offsets of each task block, render all work item schedule blocks on the two-dimensional canvas in a non-overlapping manner, ensuring that different schedule blocks of the same work item maintain a horizontally continuous layout.

[0026] Specifically, it includes the following steps: Initialization stage: a. Sort all work items by the minimum start time to generate an ordered work item queue; b. Determine the global date range based on the start and end dates of all work items, including the earliest start date and the latest end date; the method for determining the global date range also includes a dynamic expansion mechanism: When it is detected that the start / end date of a newly added work item exceeds the current global date range, automatically expand the date coverage range of the date-row number mapping table, recalculate the horizontal offsets of all task blocks, and trigger a visualization re-rendering.

[0027] c. Create a date-row number mapping table, use the Map<Date, Set<RowNumber>> data structure to record the set of row numbers occupied by each date, and the set of row numbers corresponding to each date is empty during initialization; d. Set the baseline value of the kanban start date for calculating the horizontal offset of subsequent task blocks.

[0028] Scheduling calculation phase: a. Traverse the ordered work item queue and perform the following operations on each work item: b. Parse all the task schedules of the work item to generate a corresponding continuous date sequence; c. Query the date-line number mapping table to obtain the set of occupied line numbers for each date in the date sequence; d. Calculate the minimum available line number that can be allocated for the date sequence through a recursive algorithm, ensuring that this line number is not occupied in all relevant dates; e. Update the minimum available line number to the line number set corresponding to the date in the date-line number mapping table; calculate the horizontal offset based on the baseline value of the start date and the task start date, and calculate the vertical offset by combining the minimum available line number and the line height parameter.

[0029] The specific calculation method of the horizontal offset is as follows: Horizontal offset = (Task start date - Baseline value of the start date) × Pixel width per day.

[0030] The specific calculation method of the vertical offset is as follows: Vertical offset = Minimum available line number × Pixel height per line.

[0031] Among them, the recursive algorithm is specifically as follows: Start detecting line by line from line 0 to check if it meets the condition: for all dates in the date sequence, the currently detected line number is not included in the date-line number mapping table; When the first line number that meets the condition is detected, immediately terminate the recursion and return that line number.

[0032] Visual rendering phase: According to the horizontal and vertical offsets of each task block, render all the work item schedule blocks on the two-dimensional canvas in a non-overlapping manner, and keep the different schedule blocks of the same work item in a horizontally continuous layout.

[0033] It also includes: Use the same color coding for different schedule blocks of the same work item; Generate continuous rectangular blocks for visual expression when there is cross-day scheduling.

[0034] Conflict handling mechanism: When it is detected that two work item schedule blocks overlap on the same date and line number, re-execute the recursive algorithm for the later inserted work item to allocate a new line number, generate a visual warning sign and record the scheduling conflict log.

[0035] The work item visualization scheduling management method based on dynamic row allocation in the present invention has brought a revolutionary improvement to the visualization of project management and work item scheduling. First, in the initialization stage, by sorting all work items and determining the global date range, a solid foundation is laid for subsequent scheduling calculations. The creation of the date-row number mapping table further enables efficient management and tracking of dates and row numbers, greatly improving the accuracy and operability of scheduling. In the scheduling calculation stage, the smallest available row number that can be allocated is calculated through a recursive algorithm, ensuring that each work item can find a suitable position among the unoccupied row numbers. At the same time, by combining the horizontal offset calculated based on the start date reference value and the task start date, and the vertical offset calculated based on the smallest available row number and the row height parameter, the accurate positioning of the work item scheduling block on the two-dimensional canvas is achieved. This not only avoids the overlap between work items but also ensures that different scheduling blocks of the same work item can maintain a horizontally continuous layout, thereby improving the readability and comprehensibility of the schedule. In the visualization rendering stage, according to the calculated horizontal and vertical offsets, all work item scheduling blocks are rendered on the two-dimensional canvas in a non-overlapping manner. This enables project managers to view the scheduling situations of all work items at a glance, quickly identify the critical path and potential conflicts of the project, and thus make timely adjustments and optimizations. Through scientific and efficient scheduling calculations and visualization rendering, the efficiency and accuracy of project management are greatly improved, and the cognitive load and operation difficulty are reduced. At the same time, it also has good scalability and compatibility, can adapt to the project management requirements of different scales and complexities, and provides strong support for the modernization and intelligentization of project management.

[0036] An embodiment of the present invention is a work item visualization scheduling management system based on dynamic row allocation, which specifically includes the following modules: A work item sorting module, which is used to sort all work items according to the minimum start time of the work items; A date range determination module, which is used to determine the earliest start date and the latest end date of all work items; A date occupancy mapping table initialization module, which is used to initialize the date occupancy mapping table; A task block data generation module, which is used to traverse each sorted work item and generate task block data including date, row number, horizontal offset, and vertical offset; A kanban rendering module, which is used to render a compact work item kanban layout on the visualization interface according to the task block data.

[0037] In the work item visualization scheduling management system based on dynamic row allocation in the present invention, through the work item sorting module, the system can sort all tasks in an orderly manner according to the minimum start time of the work items, which helps managers quickly grasp the time rhythm of the project, identify work items with higher priorities, and thus make reasonable plans. The date range determination module can automatically determine the earliest start date and the latest end date of all work items, providing a clear time frame for subsequent scheduling management. This not only simplifies the process of manually determining the date range but also improves the accuracy and consistency of scheduling. The date occupancy mapping table initialization module is the key for the system to implement dynamic row allocation. By initializing the date occupancy mapping table, the system can real-time track the row number occupancy of each date, ensuring that unoccupied row numbers can be found when allocating new work items, thus avoiding overlaps and conflicts between work items. The task block data generation module further refines the scheduling information of work items, including key parameters such as date, row number, horizontal offset, and vertical offset. The precise calculation of these parameters provides reliable data support for the kanban rendering, enabling work items to be presented in a compact and clear manner on the visualization interface. The kanban rendering module uses the task block data to render a compact work item kanban layout on the visualization interface. This not only intuitively shows the scheduling situation of all work items but also facilitates managers to perform operations such as dragging and zooming, thereby flexibly adjusting the scheduling of work items. It greatly improves the flexibility and efficiency of project management, enabling managers to keep track of the project progress at any time and respond to various changes in a timely manner.

[0038] An embodiment of the present invention provides a terminal device. The terminal device in this embodiment includes: a processor, a memory, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps in the above-mentioned method embodiments. Alternatively, when the processor executes the computer program, it implements the functions of each module / unit in the above-mentioned device embodiments.

[0039] The computer program can be divided into one or more modules / units, and the one or more modules / units are stored in the memory and executed by the processor to complete the present invention.

[0040] The device / terminal device can be a computing device such as a desktop computer, a notebook, a palm computer, and a cloud server. The device / terminal device may include, but is not limited to, a processor and a memory.

[0041] The processor may be a Central Processing Unit (CPU), or may also be other general-purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field-Programmable Gate Arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.

[0042] The memory can be used to store the computer program and / or modules. By running or executing the computer program and / or modules stored in the memory, and by invoking the data stored in the memory, the processor realizes various functions of the device / terminal equipment.

[0043] If the modules / units integrated in the device / terminal equipment are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on such an understanding, to implement all or part of the processes in the above-described embodiment methods of the present invention, it can also be completed by a computer program instructing relevant hardware. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor, the steps of the above-described various method embodiments can be realized. Among them, the computer program includes computer program code, and the computer program code can be in the form of source code, object code, executable file, or some intermediate form, etc. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disc, computer memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier signal, telecommunication signal, and software distribution medium, etc. It should be noted that the content included in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, the computer-readable medium does not include electrical carrier signals and telecommunication signals.

[0044] The above are only the preferred embodiments of the present invention and are not used to limit the present invention. For those skilled in the art, the present invention can have various changes and modifications. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included within the protection scope of the present invention.

Claims

1. A work item visual scheduling management method based on dynamic row allocation, characterized in that: The following steps are involved: Initialization phase: a. Sort all work items by their minimum start time to generate an ordered work item queue; b. Determine the global date range based on the start and end dates of all work items, including the earliest start date and the latest end date; c. Create a date-row number mapping table, using the Map<date, Set<row number>> data structure to record the row number set occupied by each date. When initialized, the row number set corresponding to each date is empty; d. Set the kanban start date reference value to calculate the horizontal offset of subsequent task blocks; Schedule calculation stage: a. Traverse the ordered work item queue and perform the following operations on each work item: b. Analyze all task schedules of the work item and generate the corresponding continuous date sequence; c. Query the date-row number mapping table to obtain the row number set occupied by each date in the date sequence; d. Calculate the minimum available row number that can be assigned to the date sequence through a recursive algorithm to ensure that the row number is not occupied in all relevant dates; e. updating the minimum available row number to the row number set corresponding to the date in the date-row number mapping table; calculating the horizontal offset based on the start date reference value and the task start date, and calculating the vertical offset in combination with the minimum available row number and row height parameter; Visualization rendering stage: According to the horizontal offset and vertical offset of each task block, all work item scheduling blocks are rendered in a non-overlapping manner on the two-dimensional canvas, and different scheduling blocks of the same work item are kept in a horizontally continuous layout.

2. A method for visual scheduling management of work items based on dynamic row allocation as described in claim 1, characterized in that: The method for determining the global date range also includes a dynamic expansion mechanism: When it is detected that the start / end date of a newly added work item exceeds the current global date range, the date coverage range of the date-row number mapping table is automatically expanded, the horizontal offsets of all task blocks are recalculated, and visual re-rendering is triggered.

3. A method for visual scheduling management of work items based on dynamic row allocation as described in claim 1, characterized in that: The recursive algorithm in the scheduling calculation stage is specifically as follows: Starting from row 0, check row by row whether the following is satisfied: for all dates in the date sequence, the current detection row number is not included in the date-row number mapping table; When the first line number that meets the condition is detected, the recursion is terminated immediately and the line number is returned.

4. A method for visual scheduling management of work items based on dynamic row allocation as described in claim 1, characterized in that: The calculation method of the horizontal offset is specifically as follows: Horizontal offset = (task start date - start date base value) × single-day pixel width.

5. A method for visual scheduling management of work items based on dynamic row allocation as described in claim 1, characterized in that: The calculation method of the vertical offset is specifically as follows: Vertical offset = minimum available line number × single line pixel height.

6. A method for visual scheduling management of work items based on dynamic row allocation as described in claim 1, characterized in that: The rendering process also includes: Use the same color coding for different scheduling blocks of the same work item; When there is a multi-day schedule, continuous rectangular blocks are generated for visual expression.

7. A method for visual scheduling management of work items based on dynamic row allocation as described in claim 1, characterized in that: The method also includes a conflict handling mechanism: When it is detected that two work item scheduling blocks overlap on the same date and line number, the recursive algorithm is re-executed for the later inserted work item to assign a new line number, generate a visual warning mark and record the scheduling conflict log.

8. A work item visual scheduling management system based on dynamic row allocation, characterized in that: Includes the following modules: Work item sorting module, used to sort all work items by their minimum start time; Date range determination module, used to determine the earliest start date and latest end date of all work items; A date occupancy mapping table initialization module is used to initialize the date occupancy mapping table; A task block data generation module is used to traverse each sorted work item and generate task block data including date, line number, horizontal offset and vertical offset; The Kanban rendering module is used to render a compact work item Kanban layout on a visual interface based on task block data.

9. A device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images