default search action
Jean-Charles Billaut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Tifenn Rault
, Faiza Sadi, Jean-Charles Billaut, Ameur Soukhal:
Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization. J. Sched. 27(5): 485-505 (2024) - 2023
- [j35]Lotte Berghman
A review on integrated scheduling and outbound vehicle routing problems. Eur. J. Oper. Res. 311(1): 1-23 (2023) - 2021
- [j34]Hugo Chevroton, S. U. K. Rohmer, Jean-Charles Billaut:
A production and distribution framework: Manufacturer dominates. Comput. Ind. Eng. 155: 107162 (2021) - [j33]Hugo Chevroton, Yannick Kergosien, Lotte Berghman
Solving an integrated scheduling and routing problem with inventory, routing and penalty costs. Eur. J. Oper. Res. 294(2): 571-589 (2021)
2010 – 2019
- 2019
- [j32]Jean-Charles Billaut, Federico Della Croce
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. J. Sched. 22(1): 59-68 (2019) - 2018
- [j31]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) - 2017
- [j30]Yannick Kergosien
A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints. Eur. J. Oper. Res. 262(1): 287-298 (2017) - [j29]Azeddine Cheref, Alessandro Agnetis, Christian Artigues, Jean-Charles Billaut:
Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence. J. Sched. 20(6): 681-693 (2017) - [i1]Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt:
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths. CoRR abs/1707.02849 (2017) - 2016
- [c8]Azeddine Cheref, Alessandro Agnetis, Christian Artigues, Jean-Charles Billaut:
Fixed-sequence Single Machine Scheduling and Outbound Delivery Problems. ICORES 2016: 145-151 - [c7]Azeddine Cheref, Christian Artigues, Jean-Charles Billaut, Sandra Ulrich Ngueveu
Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation. ISCO 2016: 439-450 - 2015
- [j28]Jean-Charles Billaut, Federico Della Croce
A single machine scheduling problem with two-dimensional vector packing constraints. Eur. J. Oper. Res. 243(1): 75-81 (2015) - [j27]Hélène Blasco, Jerzy Blaszczynski
Comparative analysis of targeted metabolomics: Dominance-based rough set approach versus orthogonal partial least square-discriminant analysis. J. Biomed. Informatics 53: 291-299 (2015) - [j26]Alessandro Agnetis
Nash equilibria for the multi-agent project scheduling problem with controllable processing times. J. Sched. 18(1): 15-27 (2015) - 2014
- [b2]Alessandro Agnetis
Multiagent Scheduling - Models and Algorithms. Springer 2014, ISBN 978-3-642-41879-2, pp. I-XIII, 1-271 - [j25]Faiza Sadi, Ameur Soukhal, Jean-Charles Billaut:
Solving multi-agent scheduling problems on parallel machines with a global objective function. RAIRO Oper. Res. 48(2): 255-269 (2014) - 2013
- [j24]Yannick Kergosien
Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex. Comput. Oper. Res. 40(10): 2508-2518 (2013) - [c6]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 - 2012
- [j23]Nguyen Huynh Tuong, Ameur Soukhal, Jean-Charles Billaut:
Single-machine multi-agent scheduling problems with a global objective function. J. Sched. 15(3): 311-321 (2012) - [c5]Jean-Charles Billaut, Emmanuel Hebrard
Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem. CPAIOR 2012: 66-80 - 2011
- [j22]Yannick Kergosien
A tabu search heuristic for the dynamic transportation of patients between care units. Eur. J. Oper. Res. 214(2): 442-452 (2011) - [j21]Yannick Kergosien
Planning and tracking chemotherapy production for cancer treatment: A performing and integrated solution. Int. J. Medical Informatics 80(9): 655-662 (2011) - [c4]Jean-Charles Billaut:
New scheduling problems with perishable raw materials constraints. ETFA 2011: 1-7 - [c3]Jean-Charles Billaut, Pierre Lopez:
Characterization of all ρ-approximated sequences for some scheduling problems. ETFA 2011: 1-6 - [c2]Cyril Briand
Cooperative project scheduling with controllable processing times: A game theory framework. ETFA 2011: 1-7 - 2010
- [j20]Alexandre Mazier, Jean-Charles Billaut, Jean-François Tournamille
Scheduling preparation of doses for a chemotherapy service. Ann. Oper. Res. 178(1): 145-154 (2010) - [j19]Nguyen Huynh Tuong, Ameur Soukhal, Jean-Charles Billaut:
A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines. Eur. J. Oper. Res. 202(3): 646-653 (2010) - [j18]Jean-Charles Billaut, Denis Bouyssou
Should you believe in the Shanghai ranking? - An MCDM view. Scientometrics 84(1): 237-263 (2010)
2000 – 2009
- 2009
- [j17]Jean-Charles Billaut, Francis Sourd:
Single machine scheduling with forbidden start times. 4OR 7(1): 37-50 (2009) - 2008
- [j16]Geoffrey Vilcot, Jean-Charles Billaut:
A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. Eur. J. Oper. Res. 190(2): 398-411 (2008) - 2007
- [j15]Jean-Charles Billaut, Emmanuel Néron:
Éditorial. RAIRO Oper. Res. 41(2): 123 (2007) - 2006
- [b1]Vincent T'kindt, Jean-Charles Billaut:
Multicriteria Scheduling - Theory, Models and Algorithms (2. ed.). Springer 2006, ISBN 978-3-540-28230-3, pp. I-XVI, 1-359 - [j14]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
- [j13]Samuel Guirchoun, Patrick Martineau, Jean-Charles Billaut:
Total completion time minimization in a computer system with a server and two parallel processors. Comput. Oper. Res. 32: 599-611 (2005) - [j12]Vincent T'kindt
The e-OCEA project: towards an Internet decision system for scheduling problems. Decis. Support Syst. 40(2): 329-337 (2005) - [j11]Christian Artigues, Jean-Charles Billaut, Carl Esswein:
Maximization of solution flexibility for robust shop scheduling. Eur. J. Oper. Res. 165(2): 314-328 (2005) - [j10]Vincent T'kindt
Multicriteria scheduling. Eur. J. Oper. Res. 167(3): 589-591 (2005) - [j9]Carl Esswein, Jean-Charles Billaut, Vitaly A. Strusevich:
Two-machine shop scheduling: Compromise between flexibility and makespan value. Eur. J. Oper. Res. 167(3): 796-809 (2005) - [j8]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) - [j7]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 - 2004
- [j6]Sylvain Bertel, Jean-Charles Billaut:
A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. Eur. J. Oper. Res. 159(3): 651-662 (2004) - 2003
- [j5]Vincent T'kindt
Two-machine flowshop scheduling with a secondary criterion. Comput. Oper. Res. 30(4): 505-526 (2003) - 2002
- [j4]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) - 2001
- [j3]Vincent T'kindt
Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry. Eur. J. Oper. Res. 135(1): 42-49 (2001) - [j2]Vincent T'kindt
Multicriteria scheduling problems: a survey. RAIRO Oper. Res. 35(2): 143-163 (2001)
1990 – 1999
- 1999
- [j1]A. Vignier, Jean-Charles Billaut, Christian Proust:
Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art. RAIRO Oper. Res. 33(2): 117-183 (1999)
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-11-07 20:32 CET 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: