A polynomial time OPT-1 algorithm for a scheduling problem with two delivery dates and cumulative payoffs

Yasmina Seddik 1 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 two common delivery dates and unequal release dates for the jobs. The goal is to maximize the cumulative number of jobs processed before each delivery date. The general problem (with K ≥ 2 delivery dates) results from a practical situation in book digitization. The two delivery dates case considered here is weakly NP-hard. In this paper, we show for this problem a polynomial time algorithm with an absolute guarantee of 1. By considering the two delivery dates problem, this paper lays the basis for an approximation algorithm for the general K delivery dates problem.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01217822
Contributor : Lip6 Publications <>
Submitted on : Tuesday, October 20, 2015 - 10:30:12 AM
Last modification on : Thursday, March 21, 2019 - 2:32:20 PM

Identifiers

  • HAL Id : hal-01217822, version 1

Citation

Yasmina Seddik, Christophe Gonzales, Safia Kedad-Sidhoum. A polynomial time OPT-1 algorithm for a scheduling problem with two delivery dates and cumulative payoffs. 6th Multidisciplinary International Scheduling Conference: Theory and Applications, MISTA 2013, Aug 2013, Gent, Belgium. pp.268-289. ⟨hal-01217822⟩

Share

Metrics

Record views

52