Semi-online scheduling on a single machine with unexpected breakdown - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2016

Semi-online scheduling on a single machine with unexpected breakdown

Résumé

In this paper, we consider a single machine scheduling problem where a breakdown period occurs in an online way. Two main objective functions are studied: the makespan and the maximum lateness. We propose two approximation algorithms for the makespan minimization for solving two variants of the problem: with different release dates or without release dates. We show that the competitive ratio of the two algorithms is 3/2 and that this bound is the best possible for the makespan minimization. For the maximum lateness minimization we propose a (1 + 2/2) = 1.70- approximation algorithm capable to solve the problem with delivery times but no release dates. This ratio is tight for the proposed algorithm and allows us to establish a precise window for the best possible ratio, which belongs to [3/2,1 + 2/2] = [1.50, 1.70]

Dates et versions

hal-03939467 , version 1 (14-01-2023)

Identifiants

Citer

Imed Kacem, Hans Kellerer. Semi-online scheduling on a single machine with unexpected breakdown. Theoretical Computer Science, 2016, 646, pp.40-48. ⟨10.1016/j.tcs.2016.07.014⟩. ⟨hal-03939467⟩
8 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More