Mourad Boudhar

Orcid: 0000-0002-1624-9340

According to our database1, Mourad Boudhar authored at least 30 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Scheduling on uniform machines with a conflict graph: complexity and resolution.
Int. Trans. Oper. Res., March, 2024

On the complexity of proportionate open shop and job shop problems.
Optim. Lett., January, 2024

Scheduling on identical machines with preemption and setup times.
Int. J. Prod. Res., January, 2024

2023
Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicity.
Int. J. Math. Oper. Res., 2023

Equitable colouring and scheduling on identical machines.
Int. J. Math. Oper. Res., 2023

Throughput optimisation in reentrant circular regular robot cells.
Int. J. Math. Oper. Res., 2023

Compatibility graphs in scheduling on batch processing machines.
CoRR, 2023

2022
A cloud weather forecasting service and its relationship with anomaly detection.
Serv. Oriented Comput. Appl., 2022

A two-machine no-wait flow shop problem with two competing agents.
J. Comb. Optim., 2022

2021
Two-machine open shop problem with a single server and set-up time considerations.
Theor. Comput. Sci., 2021

2019
Two-machine open shop problem with agreement graph.
Theor. Comput. Sci., 2019

New results in two identical machines scheduling with agreement graphs.
Theor. Comput. Sci., 2019

Scheduling identical jobs on uniform machines with a conflict graph.
Comput. Oper. Res., 2019

Two-machine flowshop scheduling problem with coupled-operations.
Ann. Oper. Res., 2019

2018
Flow shop scheduling problem with conflict graphs.
Ann. Oper. Res., 2018

2017
Two-machine flow shop problem with unit-time operations and conflict graph.
Int. J. Prod. Res., 2017

Scheduling two identical parallel machines with preparation constraints.
Int. J. Prod. Res., 2017

Chain-reentrant shop with an exact time lag: new results.
Int. J. Prod. Res., 2017

Open shop scheduling problems with conflict graphs.
Discret. Appl. Math., 2017

2016
Two machines flow shop with reentrance and exact time lag.
RAIRO Oper. Res., 2016

Branch-and-bound and PSO algorithms for no-wait job shop scheduling.
J. Intell. Manuf., 2016

2015
Scheduling: Agreement graph vs resource constraints.
Eur. J. Oper. Res., 2015

2012
Scheduling on parallel machines with preemption and transportation delays.
Comput. Oper. Res., 2012

Scheduling jobs on identical machines with agreement graph.
Comput. Oper. Res., 2012

2011
Two machine Flow shop with transportation time.
Stud. Inform. Univ., 2011

2010
Two-stage hybrid flow shop with recirculation.
Int. Trans. Oper. Res., 2010

2009
Preemptive scheduling in the presence of transportation times.
Comput. Oper. Res., 2009

2005
Scheduling on a Batch Processing Machine with Split Compatibility Graphs.
J. Math. Model. Algorithms, 2005

2003
Scheduling a batch processing machine with bipartite compatibility graphs.
Math. Methods Oper. Res., 2003

Dynamic Scheduling on a Single Batch Processing Machine with Split Compatibility Graphs.
J. Math. Model. Algorithms, 2003


  Loading...