Scheduling mobile collaborating workforce for multiple urgent events

Authors:
Yuqing Sun;Dickson K. W. Chiu;Bin Gong;Xiangxu Meng;Peng Zhang
Affiliations:
School of Computer Science and Technology, Shandong University, China;Dickson Computer Systems, Hong Kong;School of Computer Science and Technology, Shandong University, China;School of Computer Science and Technology, Shandong University, China;School of Computer Science and Technology, Shandong University, China
Venue:
Journal of Network and Computer Applications
Year:
2012

Citing 11
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A procedure for ranking efficient units in data envelopment analysis

Management Science
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Computing Minimum-Weight Perfect Matchings

INFORMS Journal on Computing
Query Processing in Mobile Environments: A Survey and Open Problems

DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications
e-Government Integration with Web Services and Alerts: A Case Study on an Emergency Route Advisory System in Hong Kong

HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 04
Supporting location-based conditions in access control policies

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
GEO-RBAC: A spatially aware RBAC

ACM Transactions on Information and System Security (TISSEC)
Workforce optimization: identification and assignment of professional workers using constraint programming

IBM Journal of Research and Development - Business optimization
Constraint-Based Authorization Management for Mobile Collaboration Services

SERVICES '09 Proceedings of the 2009 Congress on Services - I
On the Complexity of Authorization in RBAC under Qualification and Security Constraints

IEEE Transactions on Dependable and Secure Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Despite the advancement of wireless technologies that allows collaboration at different places, under emergencies, professionals are often still required to arrive at the scene to carry out critical tasks. Under many practical constraints, how to schedule mobile collaborating workforce for urgent event requirements becomes a challenging problem. In this paper, we study the optimal mobile workforce assignment problems for multiple events and propose an efficient algorithm to find an optimal workforce arrangement with respect to quick response under qualification and location constraints. A practical example is given to illustrate how our method works. We also study the exception case where there are not enough qualified users. We allow a user to take on multiple qualified tasks previously assigned to different users. But each person is restricted within one event location so as to reduce traffic transfer between different places for the quick response purpose. We analyze the computational complexity of the problem of finding an optimal assignment of mobile workforce under such restraints and solve it by means of integer linear programming.