default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSafia Kedad-Sidhoum
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Isaias Faria Silva
, Cédric Bentz, Mustapha Bouhtou, Matthieu Chardy, Safia Kedad-Sidhoum:
Optimization of battery management in telecommunications networks under energy market incentives. Ann. Oper. Res. 332(1): 949-988 (2024)- [c14]Anton Medvedev, Safia Kedad-Sidhoum, Frédéric Meunier:
Two-Stage Adaptable Robust Optimization for Glass Production. ICORES 2024: 229-235 - [c13]Ruiwen Liao, Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum:
A Two-Stage Stochastic Programming Approach for Energy-Oriented Lot-Sizing. APMS (3) 2024: 348-363 - [c12]Natalia Jorquera-Bravo, Sourour Elloumi, Safia Kedad-Sidhoum, Agnès Plateau:
Fair Energy Allocation for Collective Self-consumption. ISCO 2024: 388-401 - 2023
- [j33]Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum:
A stochastic dual dynamic integer programming based approach for remanufacturing planning under uncertainty. Int. J. Prod. Res. 61(17): 5992-6012 (2023) - 2022
- [j32]Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum:
Dominance inequalities for scheduling around an unrestrictive common due date. Eur. J. Oper. Res. 296(2): 453-464 (2022) - [j31]Mehdi Charles, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum, Issam Mazhoud:
Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories. Eur. J. Oper. Res. 302(1): 203-220 (2022) - [j30]Sandra Ulrich Ngueveu, Christian Artigues, Nabil Absi, Safia Kedad-Sidhoum:
Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs. J. Heuristics 28(1): 93-120 (2022) - [j29]Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum:
Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty. INFORMS J. Comput. 34(2): 1024-1041 (2022) - 2021
- [j28]Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual:
Coordination of a two-level supply chain with contracts. 4OR 19(2): 235-264 (2021) - [j27]Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum:
Mixed integer formulations using natural variables for single machine scheduling around a common due date. Discret. Appl. Math. 290: 36-59 (2021) - [c11]Mehdi Charles, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum, Issam Mazhoud:
Capacitated lot-sizing problem with inventory constraints within periods. CASE 2021: 1021-1026 - [c10]Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum:
New Valid Inequalities for a Multi-echelon Multi-item Lot-Sizing Problem with Returns and Lost Sales. ICCL 2021: 192-207 - [c9]Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum:
A Partial Nested Decomposition Approach for Remanufacturing Planning Under Uncertainty. APMS (2) 2021: 663-672 - [i4]Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum:
Dominance inequalities for scheduling around an unrestrictive common due date. CoRR abs/2102.07382 (2021) - 2020
- [j26]Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum, Dong Quan Vu:
A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales. Comput. Oper. Res. 116: 104865 (2020) - [c8]Marc Etheve, Zacharie Alès, Côme Bissuel, Olivier Juan, Safia Kedad-Sidhoum:
Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm. CPAIOR 2020: 176-185 - [i3]Marc Etheve, Zacharie Alès, Côme Bissuel, Olivier Juan, Safia Kedad-Sidhoum:
Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm. CoRR abs/2005.10026 (2020)
2010 – 2019
- 2019
- [j25]Kerem Bülbül, Safia Kedad-Sidhoum, Halil Sen:
Single-machine common due date total earliness/tardiness scheduling with machine unavailability. J. Sched. 22(5): 543-565 (2019) - [c7]Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum:
A Stochastic Dual Dynamic Integer Programming for the Uncapacitated Lot-Sizing Problem with Uncertain Demand and Costs. ICAPS 2019: 353-361 - [c6]Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum:
Stochastic Dual Dynamic integer Programming for a multi-echelon lot-sizing problem with remanufacturing and lost sales. CoDIT 2019: 1254-1259 - [i2]Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum:
Mixed integer formulations using natural variables for single machine scheduling around a common due date. CoRR abs/1901.06880 (2019) - 2018
- [j24]Christian Artigues, Eric Bourreau, Vincent Jost, Safia Kedad-Sidhoum, François Ramond:
Trains do not vanish: the ROADEF/EURO challenge 2014. Ann. Oper. Res. 271(2): 1091-1105 (2018) - [j23]Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual:
Two-level lot-sizing with inventory bounds. Discret. Optim. 30: 1-19 (2018) - [j22]Pascale Bendotti, Pierre Fouilhoux, Safia Kedad-Sidhoum:
The Unit-capacity Constrained Permutation Problem. Eur. J. Oper. Res. 268(2): 463-472 (2018) - [j21]Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram:
A Family of Scheduling Algorithms for Hybrid Parallel Platforms. Int. J. Found. Comput. Sci. 29(1): 63-90 (2018) - 2017
- [j20]Raphaël Bleuse, Sascha Hunold, Safia Kedad-Sidhoum, Florence Monna, Gregory Mounie, Denis Trystram:
Scheduling Independent Moldable Tasks on Multi-Cores with GPUs. IEEE Trans. Parallel Distributed Syst. 28(9): 2689-2702 (2017) - 2016
- [j19]Hasan Murat Afsar, Christian Artigues, Eric Bourreau, Safia Kedad-Sidhoum:
Machine reassignment problem: the ROADEF/EURO challenge 2012. Ann. Oper. Res. 242(1): 1-17 (2016) - [j18]Nabil Absi, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum, Bernard Penz, Christophe Rapine:
The single-item green lot-sizing problem with fixed carbon emissions. Eur. J. Oper. Res. 248(3): 849-855 (2016) - [j17]Pierre Fouilhoux, Omar Jorge Ibarra-Rojas, Safia Kedad-Sidhoum, Yasmín Á. Ríos-Solís:
Valid inequalities for the synchronization bus timetabling problem. Eur. J. Oper. Res. 251(2): 442-450 (2016) - [i1]Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual:
Two-level lot-sizing with inventory bounds. CoRR abs/1604.02278 (2016) - 2015
- [j16]Raphaël Bleuse, Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram:
Scheduling independent tasks on multi-cores with GPU accelerators. Concurr. Comput. Pract. Exp. 27(6): 1625-1638 (2015) - [j15]Jacek Blazewicz, Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram:
A study of scheduling problems with preemptions on multi-core computers with GPU accelerators. Discret. Appl. Math. 196: 72-82 (2015) - [j14]Nadjib Brahimi, Nabil Absi, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum:
Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory. OR Spectr. 37(4): 983-1006 (2015) - [j13]Yasmina Seddik, Christophe Gonzales, Safia Kedad-Sidhoum:
Performance guarantees for a scheduling problem with common stepwise job payoffs. Theor. Comput. Sci. 562: 377-394 (2015) - [c5]Safia Kedad-Sidhoum, Florence Monna, Denis Trystram:
Scheduling Tasks with Precedence Constraints on Hybrid Multi-core Machines. IPDPS Workshops 2015: 27-33 - 2014
- [j12]Öncü Hazir, Safia Kedad-Sidhoum:
Batch sizing and just-in-time scheduling with common due date. Ann. Oper. Res. 213(1): 187-202 (2014) - [c4]Safia Kedad-Sidhoum, Fernando Machado Mendonca, Florence Monna, Gregory Mounie, Denis Trystram:
Fast Biological Sequence Comparison on Hybrid Platforms. ICPP 2014: 501-509 - 2013
- [j11]Nabil Absi, Stéphane Dauzère-Pérès, Safia Kedad-Sidhoum, Bernard Penz, Christophe Rapine:
Lot sizing with carbon emission constraints. Eur. J. Oper. Res. 227(1): 55-61 (2013) - [j10]Samuel Deleplanque, Safia Kedad-Sidhoum, Alain Quilliot:
Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities. RAIRO Oper. Res. 47(4): 429-443 (2013) - [j9]Yasmina Seddik, Christophe Gonzales, Safia Kedad-Sidhoum:
Single machine scheduling with delivery dates and cumulative payoffs. J. Sched. 16(3): 313-329 (2013) - [c3]Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram:
Scheduling Independent Tasks on Multi-cores with GPU Accelerators. Euro-Par Workshops 2013: 228-237 - 2012
- [c2]Samuel Deleplanque, Safia Kedad-Sidhoum, Alain Quilliot:
Lagrangean decomposition of a lot-sizing problem into facility location and multicommodity flow.. FedCSIS 2012: 385-392 - 2011
- [j8]Philippe Chrétienne, Öncü Hazir, Safia Kedad-Sidhoum:
Integrated batch sizing and scheduling on a single machine. J. Sched. 14(6): 541-555 (2011) - [c1]Heitor Liberalino, Christophe Duhamel, Alain Quilliot, Safia Kedad-Sidhoum, Philippe Chrétienne:
The integrated lot-sizing and vehicle routing problem. CIPLS 2011: 47-52 - 2010
- [j7]Safia Kedad-Sidhoum, Francis Sourd:
Fast neighborhood search for the single machine earliness-tardiness scheduling problem. Comput. Oper. Res. 37(8): 1464-1471 (2010)
2000 – 2009
- 2009
- [j6]Nabil Absi, Safia Kedad-Sidhoum:
The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs. Comput. Oper. Res. 36(11): 2926-2936 (2009) - 2008
- [j5]Nabil Absi, Safia Kedad-Sidhoum:
The multi-item capacitated lot-sizing problem with setup times and shortage costs. Eur. J. Oper. Res. 185(3): 1351-1374 (2008) - [j4]Safia Kedad-Sidhoum, Yasmín Á. Ríos-Solís, Francis Sourd:
Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. Eur. J. Oper. Res. 189(3): 1305-1316 (2008) - [j3]Francis Sourd, Safia Kedad-Sidhoum:
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. J. Sched. 11(1): 49-58 (2008) - 2007
- [j2]Nabil Absi, Safia Kedad-Sidhoum:
MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. RAIRO Oper. Res. 41(2): 171-192 (2007) - 2003
- [j1]Francis Sourd, Safia Kedad-Sidhoum:
The One-Machine Problem with Earliness and Tardiness Penalties. J. Sched. 6(6): 533-549 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
