Approximation algorithms for single machine scheduling with one unavailability period

Name: Approximation algorithms for single machine scheduling with one unavailability period
Author: Kacem, I., Haouari, Mohamed

İsim	Approximation algorithms for single machine scheduling with one unavailability period
Yazar	Kacem, I., Haouari, Mohamed
Basım Tarihi:	2009-03
Basım Yeri	- Springer Nature
Konu	Scheduling, Single machine, Approximation, Unavailability constraint
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1619-4500
Kayıt Numarası	02f1586d-430f-417d-aaa3-8cdc633a8ae2
Lokasyon	Industrial Engineering
Tarih	2009-03
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	In this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomial-time approximation scheme when the tails are equal. We derive an approximation algorithm for the general case and we show that the worst-case bound of the sequence yielded by Schrage’s algorithm is equal to 2 and that this bound is tight. Some consequences of this result are also presented.
DOI	10.1007/s10288-008-0076-6
Cilt	7

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Approximation algorithms for single machine scheduling with one unavailability period

Yazar Kacem, I., Haouari, Mohamed

Basım Tarihi 2009-03

Basım Yeri - Springer Nature

Konu Scheduling, Single machine, Approximation, Unavailability constraint

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1619-4500

Kayıt Numarası 02f1586d-430f-417d-aaa3-8cdc633a8ae2

Lokasyon Industrial Engineering

Tarih 2009-03

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin In this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomial-time approximation scheme when the tails are equal. We derive an approximation algorithm for the general case and we show that the worst-case bound of the sequence yielded by Schrage’s algorithm is equal to 2 and that this bound is tight. Some consequences of this result are also presented.

DOI 10.1007/s10288-008-0076-6

Cilt 7