Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint

•We address a scheduling problem subject to an unavailability constraint.•We study an existing interchange heuristic to minimize the total-flow time.•We improve the theoretical error bound of this heuristic and prove its tightness.•We provide computational experiments of this heuristic.•These experi...

Celý popis

Podrobná bibliografia

Vydané v:	Computers & industrial engineering Ročník 67; s. 216 - 222
Hlavní autori:	Moncel, Julien, Thiery, Jérémie, Waserhole, Ariel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.01.2014 Pergamon Press Inc Elsevier
Predmet:	Algorithms Approximation Computational experiments Computer Science Heuristic Heuristics Job shops Mathematical problems Operations Research Production scheduling Scheduling Studies Computational experiments Heuristics Scheduling
ISSN:	0360-8352, 1879-0550
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!