Advertisement

A Task Selecting Algorithm for Personal Schedules in Workflow Systems

  • Huan Yang
  • Jidong Ge
  • Quanjiang Yu
  • Chuanyi Li
  • Zhihong Zhao
  • Hao Hu
  • Bin Luo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8182)

Abstract

In personal schedules for workflow systems, a participant may be assigned a lot of tasks in a work cycle or work period. However, the cycle may not be long enough such that all the assigned tasks can be scheduled within it, i.e. there does not exist a task sequence containing all the tasks so that any two tasks do not overlap and the makespan does not exceed the work cycle. So we can filter out some tasks to make up a task subsequence based on certain strategy. The participant executes these selected tasks in the work cycle and achieves the best working efficiency. The strategy can be either maximum task amount completed in the cycle or maximum working time during the period. This paper proposes an algorithm solving this problem with experimental result showing good performance.

Keywords

Personal Schedules Work Cycle Task Selecting 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Li, H.C., Yang, Y.: Dynamic checking of temporal constraints for concurrent work-flows. Electronic Commerce Research and Applications 4, 124–142 (2005)CrossRefGoogle Scholar
  2. 2.
    Karger, D., Stein, C., Wein, J.: Scheduling Algorithms, CRC Handbook of Computer Science. CRC Press (1997)Google Scholar
  3. 3.
    Brucker, P.: Scheduling Algorithms, 5th edn. Springer (2007)Google Scholar
  4. 4.
    Li, H.C., Yang, Y., Chen, T.Y.: Resource constraints analysis of workflow specifications. The Journal of Systems and Software 73, 271–285 (2004)CrossRefGoogle Scholar
  5. 5.
    Sprecher, A., Drexl, A.: Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research 107, 431–450 (1998)CrossRefzbMATHGoogle Scholar
  6. 6.
    Mori, M., Tseng, C.C.: A genetic algorithm for multi-mode resource constrained project scheduling problem. European Journal of Operational Research 100, 134–141 (1997)CrossRefzbMATHGoogle Scholar
  7. 7.
    Hartmann, S.: Project Scheduling with Multiple Modes: A Genetic Algorithm. Annals of Operations Research 102, 111–135 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Józefowska, J., Mika, M., Różycki, R., Waligóra, G., Węglarz, J.: Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling. Annals of Operations Research 102, 13–155 (2001)CrossRefGoogle Scholar
  9. 9.
    Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research 149, 268–281 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Gajpal, Y., Rajendran, C.: An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. International Journal of Production Economics 101, 259–272 (2006)CrossRefGoogle Scholar
  11. 11.
    Rajendran, C., Ziegler, H.: Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers & Industrial Engineering 48, 789–797 (2005)CrossRefGoogle Scholar
  12. 12.
    Eder, J., Pichler, H., Gruber, W., Ninaus, M.: Personal Schedules for Workflow Systems. In: van der Aalst, W.M.P., ter Hofstede, A.H.M., Weske, M. (eds.) BPM 2003. LNCS, vol. 2678, pp. 216–231. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Huan Yang
    • 1
    • 2
  • Jidong Ge
    • 1
    • 2
    • 3
  • Quanjiang Yu
    • 1
    • 2
  • Chuanyi Li
    • 1
    • 2
  • Zhihong Zhao
    • 1
    • 2
  • Hao Hu
    • 1
  • Bin Luo
    • 1
    • 2
  1. 1.State Key Laboratory for Novel Software TechnologyNanjing UniversityChina
  2. 2.Software InstituteNanjing UniversityNanjingChina
  3. 3.Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information, Ministry of EducationNanjing University of Science and TechnologyNanjingChina

Personalised recommendations