Research Article

Intelligent Employee Task Scheduler

by  Gagandeep Garg, Utsav Dikshit
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 183 - Issue 8
Published: Jun 2021
Authors: Gagandeep Garg, Utsav Dikshit
10.5120/ijca2021921376
PDF

Gagandeep Garg, Utsav Dikshit . Intelligent Employee Task Scheduler. International Journal of Computer Applications. 183, 8 (Jun 2021), 31-35. DOI=10.5120/ijca2021921376

                        @article{ 10.5120/ijca2021921376,
                        author  = { Gagandeep Garg,Utsav Dikshit },
                        title   = { Intelligent Employee Task Scheduler },
                        journal = { International Journal of Computer Applications },
                        year    = { 2021 },
                        volume  = { 183 },
                        number  = { 8 },
                        pages   = { 31-35 },
                        doi     = { 10.5120/ijca2021921376 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2021
                        %A Gagandeep Garg
                        %A Utsav Dikshit
                        %T Intelligent Employee Task Scheduler%T 
                        %J International Journal of Computer Applications
                        %V 183
                        %N 8
                        %P 31-35
                        %R 10.5120/ijca2021921376
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper we try to solve task scheduling problem. For this a heuristic is used. The main objective of this paper is to reduce the burden of assigning tasks to employees by task manager. Parameters of employee availability, task deadline, employee free time are considered. It has become the first most priority for both the sectors of economy that is public and private sectors, to schedule the tasks provided to its employees. This research paper displays a framework and the steps required to implement that framework has been illustrated. Also model and algorithm with example to solve task scheduling problem has been included. Firstly the initial solution is provided to the proposed algorithm. The algorithm halts or stops execution after termination criteria is met.

References
  • An integer programming approach to reference staff scheduling http://www.sciencedirect.com/science/article/pii/0306457385900913
  • Balakrishnan, N and Wong, R.(1990) “A network model for the rotating workforce scheduling problem” Volume 20, pp 25-42
  • Java : The Complete Reference(10th edition) : java SE 9(jdk 9) Herbert Schildt – Introduction to Swing, pp 1011
  • M.R. Garey and D.S. Johnson, Computers and intractability: A Guide to the theory of NP-Completeness. New York: Freeman, 1979.
  • Approach for a constraint employee scheduling problem as applied to employees at mall shops http://www.sersc.org/journels/IJAST/vol14/1.pdf
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Task Scheduling Task Assignment Heuristics Task Deadline

Powered by PhDFocusTM