Mourad Boudhar

36 papers Journal 36

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Scheduling on identical machines with conflicts to minimize the mean flow time. CoRR Nour El Houda Tellache, Lydia Aoudia, Mourad Boudhar
2024	J	`jnl`	New efficient algorithms for the two-machine no-wait chain-reentrant shop problem. J. Comb. Optim. Nazim Sami, Karim Amrouche, Mourad Boudhar
2024	J	`jnl`	On the complexity of proportionate open shop and job shop problems. Optim. Lett. Abdennour Azerine, Mourad Boudhar, Djamal Rebaine
2024	J	`jnl`	Reentrant open shop scheduling problem with time lags and no-wait constraints. Comput. Oper. Res. Kenza Alioui, Karim Amrouche, Mourad Boudhar
2024	J	`jnl`	Scheduling on identical machines with preemption and setup times. Int. J. Prod. Res. Amina Haned, Abida Kerdali, Mourad Boudhar
2024	J	`jnl`	Scheduling on uniform machines with a conflict graph: complexity and resolution. Int. Trans. Oper. Res. Amin Mallek, Mourad Boudhar
2024	J	`jnl`	Solving the two-machine open shop problem with a single server with respect to the makespan. Ann. Oper. Res. Nadia Babou, Djamal Rebaine, Mourad Boudhar
2024	J	`jnl`	Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times. Discret. Optim. Nadia Babou, Mourad Boudhar, Djamal Rebaine
2024	J	`jnl`	Two-machine reentrant circular robotic cells with swap ability. Int. J. Comput. Sci. Math. Ali Khebouche, Mourad Boudhar
2023	J	`jnl`	Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicity. Int. J. Math. Oper. Res. Djedjiga Ouiddir, Mourad Boudhar, Karima Bouibede-Hocine
2023	J	`jnl`	Compatibility graphs in scheduling on batch processing machines. CoRR Khaoula Bouakaz, Mourad Boudhar
2023	J	`jnl`	Equitable colouring and scheduling on identical machines. Int. J. Math. Oper. Res. Sarah Nouri, Mourad Boudhar
2023	J	`jnl`	Throughput optimisation in reentrant circular regular robot cells. Int. J. Math. Oper. Res. Ali Khebouche, Mourad Boudhar, El-sedik Lamini
2022	J	`jnl`	A cloud weather forecasting service and its relationship with anomaly detection. Serv. Oriented Comput. Appl. Amina Khedimi, Tarek Menouer, Christophe Cérin, Mourad Boudhar
2022	J	`jnl`	A two-machine no-wait flow shop problem with two competing agents. J. Comb. Optim. Abdennour Azerine, Mourad Boudhar, Djamal Rebaine
2021	J	`jnl`	Two-machine open shop problem with a single server and set-up time considerations. Theor. Comput. Sci. Nadia Babou, Djamal Rebaine, Mourad Boudhar
2019	J	`jnl`	New results in two identical machines scheduling with agreement graphs. Theor. Comput. Sci. Amine Mohabeddine, Mourad Boudhar
2019	J	`jnl`	Scheduling identical jobs on uniform machines with a conflict graph. Comput. Oper. Res. Amin Mallek, Mohamed Bendraouche, Mourad Boudhar
2019	J	`jnl`	Two-machine flowshop scheduling problem with coupled-operations. Ann. Oper. Res. Nadjat Meziani, Ammar Oulamara, Mourad Boudhar
2019	J	`jnl`	Two-machine open shop problem with agreement graph. Theor. Comput. Sci. Nour El Houda Tellache, Mourad Boudhar, Farouk Yalaoui
2018	J	`jnl`	Flow shop scheduling problem with conflict graphs. Ann. Oper. Res. Nour El Houda Tellache, Mourad Boudhar
2017	J	`jnl`	Chain-reentrant shop with an exact time lag: new results. Int. J. Prod. Res. Karim Amrouche, Mourad Boudhar, Mohamed Bendraouche, Farouk Yalaoui
2017	J	`jnl`	Open shop scheduling problems with conflict graphs. Discret. Appl. Math. Nour El Houda Tellache, Mourad Boudhar
2017	J	`jnl`	Scheduling two identical parallel machines with preparation constraints. Int. J. Prod. Res. Wafaa Labbi, Mourad Boudhar, Ammar Oulamara
2017	J	`jnl`	Two-machine flow shop problem with unit-time operations and conflict graph. Int. J. Prod. Res. Nour El Houda Tellache, Mourad Boudhar
2016	J	`jnl`	Branch-and-bound and PSO algorithms for no-wait job shop scheduling. J. Intell. Manuf. Abdelhakim AitZai, Brahim Benmedjdoub, Mourad Boudhar
2016	J	`jnl`	Two machines flow shop with reentrance and exact time lag. RAIRO Oper. Res. Karim Amrouche, Mourad Boudhar
2015	J	`jnl`	Scheduling: Agreement graph vs resource constraints. Eur. J. Oper. Res. Mohamed Bendraouche, Mourad Boudhar, Ammar Oulamara
2012	J	`jnl`	Scheduling jobs on identical machines with agreement graph. Comput. Oper. Res. Mohamed Bendraouche, Mourad Boudhar
2012	J	`jnl`	Scheduling on parallel machines with preemption and transportation delays. Comput. Oper. Res. Amina Haned, Ameur Soukhal, Mourad Boudhar, Nguyen Huynh Tuong
2011	J	`jnl`	Two machine Flow shop with transportation time. Stud. Inform. Univ. Mourad Boudhar, Nacira Chikhi
2010	J	`jnl`	Two-stage hybrid flow shop with recirculation. Int. Trans. Oper. Res. Mourad Boudhar, Nadjat Meziani
2009	J	`jnl`	Preemptive scheduling in the presence of transportation times. Comput. Oper. Res. Mourad Boudhar, Amina Haned
2005	J	`jnl`	Scheduling on a Batch Processing Machine with Split Compatibility Graphs. J. Math. Model. Algorithms Mourad Boudhar
2003	J	`jnl`	Dynamic Scheduling on a Single Batch Processing Machine with Split Compatibility Graphs. J. Math. Model. Algorithms Mourad Boudhar
2003	J	`jnl`	Scheduling a batch processing machine with bipartite compatibility graphs. Math. Methods Oper. Res. Mourad Boudhar