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

• Published in: Computers & industrial engineering Vol. 67; pp. 216 - 222
• Main Authors: Moncel, Julien, Thiery, Jérémie, Waserhole, Ariel
• Format: Journal Article
• Language: English
• Published: New York Elsevier Ltd 01.01.2014; Pergamon Press Inc; Elsevier
• Subjects: Algorithms; Approximation; Computational experiments; Computer Science; Heuristic; Heuristics; Job shops; Mathematical problems; Operations Research; Production scheduling; Scheduling; Studies; Computational experiments; Heuristics; Scheduling

•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...