default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmeur Soukhal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]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)- 2022
- [j15]Mohamed Lemine Ahmed Sidi, Ronan Bocquillon, Hafedh Mohamed-Babou, Cheikh Dhib, Emmanuel Néron, Ameur Soukhal, Mohamedade Farouk Nanne:
Improved approaches to solve the One-To-One SkewGraM problem. Comput. Oper. Res. 138: 105584 (2022) - 2021
- [j14]Trang Hong Son, Tran Van Lang, Nguyen Huynh Tuong, Ameur Soukhal:
Resolution for bounded-splitting jobs scheduling problem on a single machine in available time-windows. J. Ambient Intell. Humaniz. Comput. 12(1): 1179-1196 (2021) - 2020
- [c8]Joris Werling, Claude Yugma, Ameur Soukhal, Thierry Mohr:
An Agent-Based Simulation Model with Human Resource Integration for Semiconductor Manufacturing Facility. WSC 2020: 1801-1812
2010 – 2019
- 2019
- [c7]Boukhalfa Zahout, Ameur Soukhal, Patrick Martineau:
Fixed Jobs Multi-agent Scheduling Problem with Renewable Resources. EA 2019: 162-176 - 2018
- [j13]Alexandre Dolgui, Sergey Kovalev, Mikhail Y. Kovalyov, Sergey Malyutin, Ameur Soukhal:
Optimal workforce assignment to operations of a paced assembly line. Eur. J. Oper. Res. 264(1): 200-211 (2018) - 2017
- [j12]Faiza Sadi, Ameur Soukhal:
Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs. Discret. Optim. 23: 93-104 (2017) - 2016
- [c6]Faiza Sadi, T. Van Ut, Nguyen Huynh Tuong, Ameur Soukhal:
Non-disjoint Multi-agent Scheduling Problem on Identical Parallel Processors. FDSE 2016: 400-414 - 2015
- [j11]Mikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal:
Two-agent scheduling with agent specific batches on an unbounded serial batching machine. J. Sched. 18(4): 423-434 (2015) - 2014
- [b1]Alessandro Agnetis, Jean-Charles Billaut, Stanislaw Gawiejnowicz, Dario Pacciarelli, Ameur Soukhal:
Multiagent Scheduling - Models and Algorithms. Springer 2014, ISBN 978-3-642-41879-2, pp. I-XIII, 1-271 - [j10]Xin Tang, Ameur Soukhal, Vincent T'kindt:
Preprocessing for a map sectorization problem by means of mathematical programming. Ann. Oper. Res. 222(1): 551-569 (2014) - [j9]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
- [j8]Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent T'kindt:
On an extension of the Sort & Search method with application to scheduling theory. Theor. Comput. Sci. 511: 13-22 (2013) - 2012
- [j7]Amina Haned, Ameur Soukhal, Mourad Boudhar, Nguyen Huynh Tuong:
Scheduling on parallel machines with preemption and transportation delays. Comput. Oper. Res. 39(2): 374-381 (2012) - [j6]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]Mikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal:
Two-Agent Scheduling on an Unbounded Serial Batching Machine. ISCO 2012: 427-438 - 2011
- [c4]Cheikh Dhib, Anis Kooli, Ameur Soukhal, Emmanuel Néron:
Lower bounds for a multi-skill project scheduling problem. OR 2011: 471-476 - 2010
- [j5]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) - [j4]Nguyen Huynh Tuong, Ameur Soukhal:
Due dates assignment and JIT scheduling with equal-size jobs. Eur. J. Oper. Res. 205(2): 280-289 (2010)
2000 – 2009
- 2009
- [c3]Nguyen Huynh Tuong, Ameur Soukhal:
Interfering Job Set Scheduling on Two-Operation Three-Machine Flowshop. RIVF 2009: 1-5 - 2008
- [c2]Nguyen Huynh Tuong, Ameur Soukhal:
Some new polynomial cases in just-in-time scheduling problems with multiple due dates. RIVF 2008: 36-41 - 2007
- [j3]Jinjiang Yuan, Ameur Soukhal, Youjun Chen, Lingfa Lu:
A note on the complexity of flow shop scheduling with transportation constraints. Eur. J. Oper. Res. 178(3): 918-925 (2007) - 2005
- [j2]Ameur Soukhal, Ammar Oulamara, Patrick Martineau:
Complexity of flow shop scheduling problems with transportation constraints. Eur. J. Oper. Res. 161(1): 32-41 (2005) - [j1]Ameur Soukhal, Patrick Martineau:
Resolution of a scheduling problem in a flowshop robotic cell. Eur. J. Oper. Res. 161(1): 62-72 (2005) - 2001
- [c1]Ammar Oulamara, Ameur Soukhal:
Flow shop scheduling problems with transportation and capacities constraints. SMC 2001: 2540-2545
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 21:28 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:
