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

Uložené v:
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!
Popis
Shrnutí:•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 experiments demonstrate the relevance of the algorithm for applications. This paper deals with a scheduling problem on a single machine with an availability constraint. The problem is known to be NP-complete and admits several approximation algorithms. In this paper we study the approximation scheme described in He et al. [Y. He, W. Zhong, H. Gu, Improved algorithms for two single machine scheduling problems, Theoretical Computer Science 363 (2006) 257–265]. We provide the computation of an improved relative error of this heuristic, as well as a proof that this new bound is tight. We also present some computational experiments to test this heuristic on random instances. These experiments include an implementation of the fully-polynomial time approximation scheme given in Kacem and Ridha Mahjoub [I. Kacem, A. Ridha Mahjoub, Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Computers and Industrial Engineering 56 (2009) 1708–1712].
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2013.08.017