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 scheduling problem with a new 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 provide a pseudopolynomial time algorithm for the two delivery dates case based on dynamic programming, and we discuss some polynomial cases.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01285804
Contributor : Lip6 Publications <>
Submitted on : Wednesday, March 9, 2016 - 5:08:41 PM
Last modification on : Thursday, March 21, 2019 - 1:07:40 PM

Identifiers

  • HAL Id : hal-01285804, version 1

Citation

Yasmina Seddik, Christophe Gonzales, Safia Kedad-Sidhoum. Single machine scheduling with delivery dates and cumulative payoffs. 5th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA'11), Aug 2011, Phoenix, Arizona, United States. pp.261-274. ⟨hal-01285804⟩

Share

Metrics

Record views

127