Manpower allocation with time windows and job teaming constraints

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)Not applicablepeer-review

View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Title of host publicationProceedings - Annual Meeting of the Decision Sciences Institute
Pages1717-1722
Publication statusPublished - 2003
Externally publishedYes

Conference

Title34th Annual Meeting of the Decision Sciences Institute
PlaceUnited States
CityWashington, DC
Period22 - 25 November 2003

Abstract

In the Manpower Allocation Problem with Time Windows and Job-Teaming Constraints (MAPTWTC), we have a set of jobs located at various locations where each job requires a team of workers. Each job has a time window and a job duration, during which everyone on the team has to be present. The job requirement is satisfied if and only if the required composite team works for long enough duration within the job's time window. The objective of the problem is find a schedule to minimize a weighted sum of the total number of workers, the total travelling distances of all workers and their total waiting time. Two main approaches are proposed in the paper which are shown to be able to obtain very good performance.

Research Area(s)

  • Heuristics, Optimization, Work teams, Workforce planning

Citation Format(s)

Manpower allocation with time windows and job teaming constraints. / Li, X.; Li, Y. Z.; Lim, A.; Rodrigues, B.

Proceedings - Annual Meeting of the Decision Sciences Institute. 2003. p. 1717-1722.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)Not applicablepeer-review