Performance guarantees for a scheduling problem with common stepwise job payoffs

Yasmina Seddik Christophe Gonzales 1 Safia Kedad-Sidhoum 2
1 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
2 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We consider a single machine scheduling problem with unequal release dates and a common stepwise payoff function for the jobs. The goal is to maximize the sum of the jobs payoffs, which are defined with regard to some common delivery dates. The problem is strongly NP-hard. In this paper, we propose a polynomial time approximation algorithm with both absolute and relative performance guarantees. The time complexity of the approximation algorithm is O(KNlogN), N being the number of jobs and K the number of delivery dates.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01170028
Contributor : Lip6 Publications <>
Submitted on : Tuesday, June 30, 2015 - 5:21:29 PM
Last modification on : Friday, April 12, 2019 - 10:18:09 AM

Identifiers

Citation

Yasmina Seddik, Christophe Gonzales, Safia Kedad-Sidhoum. Performance guarantees for a scheduling problem with common stepwise job payoffs. Theoretical Computer Science, Elsevier, 2015, 562, pp.377-394. ⟨10.1016/j.tcs.2014.10.010⟩. ⟨hal-01170028⟩

Share

Metrics

Record views

85