Staffs scheduling hours allocation system
Abstract : Many retail stores, as well as other organizations that employ a multitude of part-time employees, rely on developing schedules frequently, since the availabilities of the employees as well as the needs of the business change often. This process is often performed on a weekly basis, and is complex and time-consuming. The schedule must typically satisfy numerous requirements, including business needs, legal restrictions, and employee availability constraints. As a result, errors are common, and employee time that could have been spent on improving sales or operations is instead consumed by the scheduling task. This project explores two solution methods for this problem. One method is the use of linear programming (LP) to develop an optimal schedule weekly. The other is the design and implementation of a scheduling system that uses a heuristic method. After developing both methods it was determined that while the LP approach may lead to optimal solutions, it was impractical due to high costs and complexity. The heuristic approach resulted in an automatic scheduling system that is easy to use, low cost, and flexible. The new scheduling system was evaluated and approved by future users.
? The proposed method is practical and flexible compared to the existing systems.
? The existing techniques usually regard task scheduling and human resource allocation as two separated activities.
? The existing models also have the assumption that each employee can only be assigned to a single task at one time due to this project are not completed on time and lacks proper planning and scheduling in the project.
? The existing system also suffers from the problem of allocating the same task for different group of employees in different periods. The Proposed model overcomes the problems in the existing models.
? All companies make every effort to cut costs, and for most companies, overtime is a huge problem when it comes to incurring high labor costs.
? A linear programming problem may be defined as a problem of obtaining an optimal solution for a linear function subject to linear constraints, which can be equalities of inequalities.
? The problem of creating an optimal schedule will involve creating an objective function based on minimizing cost, maximizing coverage, or a combination of the two, with one of the factors possibly becoming a constraint as opposed to an objective function.
? In a company environment, this problem may become costly, and has the potential to affect the morale of other workers.
• In the proposed method a practical and effective approach for the task scheduling and human resource allocation problem in software project planning with an ant colony optimization (ACO) algorithm is developed.
• The proposed system use the resources efficiently and allowing the employers to complete the particular task in the given period of time.
• It helps allocate employee to work in overtimes to manage their tasks and the proposed algorithm manages to yield better plans with lower costs, more stable workload assignments reduces the size of the search space compared with other existing approaches.
? Design a system that would efficiently and consistently satisfy the scheduling requirements and reduce or completely eliminate the issues found in the current scheduling method.
? Therefore, a consideration in this design is the potential to enable a user to handle these occasional exceptional cases efficiently and easily, for example by means of a prompt in the event of such a condition arising.
? In order for scheduling to be more efficient, the method for entering and/or importing data must be efficient as well.
? The data must be entered in such a way that a programmed scheduling algorithm can efficiently convert it into a user-friendly format.
? This task may be time consuming as well as inefficient, keeping managers from other tasks in which their involvement is more necessary.
|