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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Li, H.C., Yang, Y.: Dynamic checking of temporal constraints for concurrent work-flows. Electronic Commerce Research and Applications 4, 124–142 (2005)
Karger, D., Stein, C., Wein, J.: Scheduling Algorithms, CRC Handbook of Computer Science. CRC Press (1997)
Brucker, P.: Scheduling Algorithms, 5th edn. Springer (2007)
Li, H.C., Yang, Y., Chen, T.Y.: Resource constraints analysis of workflow specifications. The Journal of Systems and Software 73, 271–285 (2004)
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)
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)
Hartmann, S.: Project Scheduling with Multiple Modes: A Genetic Algorithm. Annals of Operations Research 102, 111–135 (2001)
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)
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)
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)
Rajendran, C., Ziegler, H.: Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers & Industrial Engineering 48, 789–797 (2005)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, H. et al. (2014). A Task Selecting Algorithm for Personal Schedules in Workflow Systems. In: Huang, Z., Liu, C., He, J., Huang, G. (eds) Web Information Systems Engineering – WISE 2013 Workshops. WISE 2013. Lecture Notes in Computer Science, vol 8182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54370-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-54370-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54369-2
Online ISBN: 978-3-642-54370-8
eBook Packages: Computer ScienceComputer Science (R0)