![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Eric Pinson
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j17]Jacques Carlier, Abderrahim Sahli
, Antoine Jouglet, Eric Pinson:
A faster checker of the energetic reasoning for the cumulative scheduling problem. Int. J. Prod. Res. 60(11): 3419-3434 (2022) - [j16]Jacques Carlier, Antoine Jouglet, Eric Pinson, Abderrahim Sahli
:
A data structure for efficiently managing a set of energy functions. J. Comb. Optim. 44(4): 2460-2481 (2022) - 2020
- [j15]Jacques Carlier, Eric Pinson, Abderrahim Sahli
, Antoine Jouglet:
An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem. Eur. J. Oper. Res. 286(2): 468-476 (2020)
2010 – 2019
- 2018
- [j14]Aurélien Froger
, Michel Gendreau, Jorge E. Mendoza
, Eric Pinson, Louis-Martin Rousseau:
Solving a wind turbine maintenance scheduling problem. J. Sched. 21(1): 53-76 (2018) - 2017
- [j13]Aurélien Froger
, Michel Gendreau, Jorge E. Mendoza
, Eric Pinson, Louis-Martin Rousseau:
A branch-and-check approach for a wind turbine maintenance scheduling problem. Comput. Oper. Res. 88: 117-136 (2017) - 2016
- [j12]Aurélien Froger
, Michel Gendreau
, Jorge E. Mendoza
, Eric Pinson, Louis-Martin Rousseau:
Maintenance scheduling in the electricity industry: A literature review. Eur. J. Oper. Res. 251(3): 695-706 (2016) - 2015
- [e3]Eric Pinson, Fernando Valente, Begoña Vitoriano
:
Operations Research and Enterprise Systems - Third International Conference, ICORES 2014, Angers, France, March 6-8, 2014, Revised Selected Papers. Communications in Computer and Information Science 509, Springer 2015, ISBN 978-3-319-17508-9 [contents] - 2014
- [j11]Olivier Guyon
, Pierre Lemaire, Eric Pinson, David Rivreau:
Solving an integrated job-shop problem with human resource constraints. Ann. Oper. Res. 213(1): 147-171 (2014) - [j10]Carlos Montoya, Odile Bellenguez-Morineau
, Eric Pinson, David Rivreau:
Branch-and-price approach for the multi-skill project scheduling problem. Optim. Lett. 8(5): 1721-1734 (2014) - [e2]Begoña Vitoriano, Eric Pinson, Fernando Valente:
ICORES 2014 - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems, Angers, Loire Valley, France, March 6-8, 2014. SciTePress 2014, ISBN 978-989-758-017-8 [contents] - 2013
- [j9]Christelle Guéret
, Eric Pinson, David Rivreau:
Combinatorial optimization in production and logistics systems. RAIRO Oper. Res. 47(4): 395-397 (2013) - 2012
- [e1]Nicolas Beldiceanu, Narendra Jussien, Eric Pinson:
Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June1, 2012. Proceedings. Lecture Notes in Computer Science 7298, Springer 2012, ISBN 978-3-642-29827-1 [contents] - 2010
- [j8]Boris Detienne
, Eric Pinson, David Rivreau:
Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates. Eur. J. Oper. Res. 201(1): 45-54 (2010) - [j7]Olivier Guyon
, Pierre Lemaire, Eric Pinson, David Rivreau:
Cut generation for an integrated employee timetabling and production scheduling problem. Eur. J. Oper. Res. 201(2): 557-567 (2010)
2000 – 2009
- 2009
- [j6]Boris Detienne
, Laurent Péridy, Eric Pinson, David Rivreau:
Cut generation for an employee timetabling problem. Eur. J. Oper. Res. 197(3): 1178-1184 (2009) - 2004
- [j5]Pascal Babu, Laurent Péridy, Eric Pinson:
A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor. Ann. Oper. Res. 129(1-4): 33-46 (2004) - [j4]Jacques Carlier, Eric Pinson:
Jackson's pseudo-preemptive schedule and cumulative scheduling problems. Discret. Appl. Math. 145(1): 80-94 (2004) - [r1]Jacques Carlier, Laurent Péridy, Eric Pinson, David Rivreau:
Elimination Rules for Job-Shop Scheduling Problem. Handbook of Scheduling 2004 - 2003
- [j3]Philippe Baptiste, Laurent Péridy, Eric Pinson:
A branch and bound to minimize the number of late jobs on a single machine with release time constraints. Eur. J. Oper. Res. 144(1): 1-11 (2003) - [j2]Laurent Péridy, Eric Pinson, David Rivreau:
Using short-term memory to minimize the weighted number of late jobs on a single machine. Eur. J. Oper. Res. 148(3): 591-603 (2003)
1990 – 1999
- 1998
- [j1]Jacques Carlier, Eric Pinson:
Jackson's Pseudo Preemptive Schedule for the Pm/r i , q i /C max scheduling problem. Ann. Oper. Res. 83: 41-58 (1998) - 1997
- [c1]Jacques Carlier, Eric Pinson:
Bounds and adjustments associated with the Pm/ri, qi/Cmax scheduling problem. JFPLC 1997: 169-
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-05-08 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint