Single machine scheduling with 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 address a single machine scheduling problem with a new optimization criterion and unequal release dates. This new criterion results from a practical situation in the domain of book digitization. Given a set of job-independent delivery dates, the goal is to maximize the cumulative number of jobs processed before each delivery date. We establish the complexity of the general problem. In addition, we discuss some polynomial cases and provide a pseudopolynomial time algorithm for the two-delivery-dates problem based on dynamic programming and some dominance properties. Experimental results are also reported.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01170496
Contributor : Lip6 Publications <>
Submitted on : Wednesday, July 1, 2015 - 4:12:44 PM
Last modification on : Thursday, March 21, 2019 - 2:54:26 PM

Links full text

Identifiers

Citation

Yasmina Seddik, Christophe Gonzales, Safia Kedad-Sidhoum. Single machine scheduling with delivery dates and cumulative payoffs. Journal of Scheduling, Springer Verlag, 2013, 16 (3), pp.313-329. ⟨10.1007/s10951-012-0302-0⟩. ⟨hal-01170496⟩

Share

Metrics

Record views

105