Consultants Scheduling with Time Windows in Management Consulting Service Enterprise

Author

Wang Qing ; Liu Kun ; Zhao Hui ; Li Xiang

Author_Institution

Sch. of Manage., Tianjin Univ. of Commerce, Tianjin, China

fYear

2009

fDate

20-22 Sept. 2009

Firstpage

1

Lastpage

5

Abstract

Management consultant scheduling problem in management consulting service enterprise is a NP-hard problem. This paper studies the problem of management consultants scheduling problems with time window. We formulate the problem where the primary objective is to minimize the makespan. This paper proposes a hybrid genetic algorithms (HGA) based on taboo search to solve the problem. It adopts a novel two-chromosome-encoding method for genetic algorithms. A case study with the MATLAB 7.0 platform is carried to test this method. Computational results are reported, which show the effectiveness of the proposed approach in finding desirable solutions.

Keywords

computational complexity; consultancies; genetic algorithms; scheduling; search problems; service industries; NP-hard problem; consultants scheduling; hybrid genetic algorithms; management consultant scheduling problem; management consulting service enterprise; taboo search; time windows; two-chromosome-encoding method; Business; Costs; Decision making; Dynamic scheduling; Genetic algorithms; Job shop scheduling; Knowledge management; Processor scheduling; Quality management; Rail transportation;

fLanguage

English

Publisher

ieee

Conference_Titel

Management and Service Science, 2009. MASS '09. International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-4638-4

Electronic_ISBN

978-1-4244-4639-1

Type

conf

DOI

10.1109/ICMSS.2009.5303408

Filename

5303408