Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption

The multi‐skill project scheduling problem (MSPSP) has been first addressed in the scheduling community for more than 15 years. This article deals with a new variant of this problem, the MSPSP with partial preemption, where only a subset of resources can be released during the preemption periods. Li...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International transactions in operational research Ročník 30; číslo 2; s. 858 - 891
Hlavní autori:	Polo‐Mejía, Oliver, Artigues, Christian, Lopez, Pierre, Mönch, Lars, Basini, Virginie
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Blackwell Publishing Ltd 01.03.2023 Wiley
Predmet:	Adaptive search techniques Algorithms Computer Science GRASP Greedy algorithms Heuristic Heuristic methods Industrial applications LNS local search multi‐skill scheduling Operations Research partial preemption Preemption Project management Resource allocation Scheduling Search algorithms LNS multi-skill scheduling GRASP local search partial preemption
ISSN:	0969-6016, 1475-3995
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!