default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Louis Bouquard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j10]Quang Chieu Ta, Jean-Charles Billaut, Jean-Louis Bouquard:
Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem. J. Intell. Manuf. 29(3): 617-628 (2018)- 2016
- [j9]Kaouthar Deghdak
, Vincent T'kindt, Jean-Louis Bouquard:
Scheduling evacuation operations. J. Sched. 19(4): 467-478 (2016) - 2015
- [c5]Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard:
Enumeration of Pareto Optima for a Bicriteria Evacuation Scheduling Problem. ICORES 2015: 162-171 - 2014
- [c4]Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard:
Heuristics for Scheduling Evacuation Operations in Case of Natural Disaster. ICORES 2014: 294-300 - 2013
- [c3]Quang Chieu Ta, Jean-Charles Billaut, Jean-Louis Bouquard:
An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem. RIVF 2013: 198-202
2000 – 2009
- 2007
- [j8]Vincent T'kindt, Federico Della Croce, Jean-Louis Bouquard:
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria. INFORMS J. Comput. 19(1): 64-72 (2007) - [c2]Cédric Pessan, Jean-Louis Bouquard, Emmanuel Néron:
Genetic Branch-and-Bound or Exact Genetic Algorithm?. Artificial Evolution 2007: 136-147 - 2006
- [j7]Jean-Louis Bouquard, Christophe Lenté:
Two-machine flow shop scheduling problems with minimal and maximal delays. 4OR 4(1): 15-28 (2006) - [j6]Jean-Louis Bouquard, Christophe Lenté, Jean-Charles Billaut:
Application of an optimization problem in Max-Plus algebra to scheduling problems. Discret. Appl. Math. 154(15): 2064-2079 (2006) - 2005
- [j5]Vincent T'kindt, Jean-Charles Billaut, Jean-Louis Bouquard, Christophe Lenté, Patrick Martineau, Emmanuel Néron, Christian Proust, C. Tacquard:
The e-OCEA project: towards an Internet decision system for scheduling problems. Decis. Support Syst. 40(2): 329-337 (2005) - [j4]Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich:
Two-machine flow shop scheduling problems with no-wait jobs. Oper. Res. Lett. 33(3): 255-262 (2005) - [j3]Ph. Mauguière, Jean-Charles Billaut, Jean-Louis Bouquard:
New Single Machine and Job-Shop Scheduling Problems with Availability Constraints. J. Sched. 8(3): 211-231 (2005) - [c1]Cyril Canon, Jean-Charles Billaut, Jean-Louis Bouquard:
Dimensioning an Inbound Call Center Using Constraint Programming. CP 2005: 841 - 2003
- [j2]Christophe Lenté, Jean-Louis Bouquard:
Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan. RAIRO Oper. Res. 37(4): 273-289 (2003) - 2002
- [j1]Thomas Lorigeon, Jean-Charles Billaut, Jean-Louis Bouquard:
A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint. J. Oper. Res. Soc. 53(11): 1239-1246 (2002)
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-04-24 22:50 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:
