Manpower allocation with time windows and job-teaming constraints

Yanzhi Li, Andrew Lim, Brian Rodrigues

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

56 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)302-311
JournalNaval Research Logistics
Volume52
Issue number4
DOIs
Publication statusPublished - Jun 2005
Externally publishedYes

Research Keywords

  • Manpower scheduling
  • Simulated annealing
  • Teams

Fingerprint

Dive into the research topics of 'Manpower allocation with time windows and job-teaming constraints'. Together they form a unique fingerprint.

Cite this