Manpower allocation with time windows and job-teaming constraints

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

39 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)302-311
Journal / PublicationNaval Research Logistics
Volume52
Issue number4
Publication statusPublished - Jun 2005
Externally publishedYes

Abstract

In this work, we study manpower allocation with time windows and job-teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP-hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc.

Research Area(s)

  • Manpower scheduling, Simulated annealing, Teams

Citation Format(s)

Manpower allocation with time windows and job-teaming constraints. / Li, Yanzhi; Lim, Andrew; Rodrigues, Brian.

In: Naval Research Logistics, Vol. 52, No. 4, 06.2005, p. 302-311.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review