Branch and bound and dynamic programming to minimize the total completion times on a single machine with availability constraints. - Imed Kacem; Cherif Sadfi; Abdelkader El Kamel (SMC, 2005)

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. - Cherif Sadfi; Bernard Penz; Christophe Rapine; Jacek Blazewicz; Piotr Formanowicz (Eur. J. Oper. Res., 2005)

Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. - Racem Mellouli; Cherif Sadfi; Chengbin Chu; Imed Kacem (Eur. J. Oper. Res., 2009)

Lagrangian relaxation and column generation-based lower bounds for the Pm, hj1‖∑wiCiPm, hj1‖∑wiCi scheduling problem. - Racem Mellouli; Imed Kacem; Cherif Sadfi; Chengbin Chu (Appl. Math. Comput., 2013)

Optimization of integrated employee timetabling and Hybrid Job Shop Scheduling under time lag constraints. - Mohamed Frihat; Cherif Sadfi; Atidel B. Hadj-Alouane (CoDIT, 2014)

An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. - Walid Hfaiedh; Cherif Sadfi; Imed Kacem; Atidel B. Hadj-Alouane (CoDIT, 2014)

A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. - Walid Hfaiedh; Cherif Sadfi; Imed Kacem; Atidel Hadj-Alouane (Appl. Math. Comput., 2015)

Optimization of the integrated problem of employee timetabling and job shop scheduling. - Mohamed Frihat; Atidel B. Hadj-Alouane; Cherif Sadfi (Comput. Oper. Res., 2022)