Scientific article
OA Policy
English

Heuristics for a project management problem with incompatibility and assignment costs

Published in

Computational Optimization and Applications, vol. 51, p. 1231-1252

Collection

  • Open Access - Licence nationale Springer

Publication date

2012

Abstract

Consider a project which consists of a set of jobs to be performed, assuming each job has a duration of at most one time period. We assume that the project manager provides a set of possible durations (in time periods) for the whole project. When a job is assigned to a specific time period, an assignment cost is encountered. In addition, for some pairs of jobs, an incompatibility cost is encountered if they are performed at the same time period. Both types of cost depend on the duration of the whole project, which also has to be determined. The goal is to assign a time period to each job while minimizing the costs. We propose a tabu search heuristic, as well as an adaptive memory algorithm, and compare them with other heuristics on large instances, and with an exact method on small instances. Variations of the problems are also discussed.

Keywords

  • Project management
  • Scheduling
  • Tabu search heuristic
  • Adaptive memory algorithm

UNIGE affiliation entities

Citation (ISO format)

ZUFFEREY, Nicolas, LABARTHE, Olivier, SCHINDL, David. Heuristics for a project management problem with incompatibility and assignment costs. In: Computational Optimization and Applications, 2012, vol. 51, p. 1231–1252. doi: 10.1007/s10589-010-9380-0

Main files (1)

Article (Published version)

Identifiers

826views
390downloads

Technical informations

Creation

29/01/2013 12:45:00

First validation

29/01/2013 12:45:00

Update

14/03/2023 20:01:20

Status update

14/03/2023 20:01:20

Last indexation

30/10/2024 08:43:57
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated