Get started
Author

Chérif Sadfi

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
2003 · Cherif Sadfi, Bernard Penz, et al. · European Journal of Operational Research · 123
Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
2008 · Racem Mellouli, Chérif Sadfi, et al. · European Journal of Operational Research · 79
Optimization of the integrated problem of employee timetabling and job shop scheduling
2021 · Mohamed Frihat, Atidel B.Hadj-Alouane, et al. · Computers & Operations Research · 22
An improved heuristic and an exact algorithm for the 2D strip and bin packing problem
2009 · Abdelghani Bekrar, Imed Kacem, et al. · International Journal of Product Development · 15
A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
2015 · Walid Hfaiedh, Chérif Sadfi, et al. · Applied Mathematics and Computation · 13
A dynamic programming algorithm for the single machine total completion time scheduling problem with availability constraints
2001 · Chérif Sadfi · 8
A Branch and Bound Algorithm for solving the 2D Strip Packing Problem
2006 · Abdelghani Bekrar, Imed Kacem, et al. · International Conference on Service Systems and Service Management · 7
Branch and Bound and Dynamic Programming to Minimize the Total Completion Times on a Single Machine with Availability Constraints
2006 · I. Kacem, C. Sadfi, et al. · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · 7
Optimization of integrated employee timetabling and Hybrid Job Shop Scheduling under time lag constraints
2014 · Mohamed Frihat, Cherif Sadfi, et al. · International Conference on Control, Decision and Information Technologies (CoDIT) · 6
Lagrangian relaxation and column generation-based lower bounds for the Pm,hj1‖∑wiCi scheduling problem
2013 · Racem Mellouli, Imed Kacem, et al. · Applied Mathematics and Computation · 5
Problèmes d'ordonnancement avec minimisation des encours
2002 · Chérif Sadfi · OpenGrey (Institut de l'Information Scientifique et Technique) · 4
Lower bounds for total weighted completion scheduling problem with availability constraints
2009 · Cherif Sadfi, Imed Kacem, et al. · International Conference on Computers and Industrial Engineering · 2
MSPT2 Heuristic and Dynamic Programming Method for the Parallel Machine Scheduling Problem with scheduled Preventive Maintenance
2006 · Racem Mellouli, Cherif Sadfi, et al. · International Conference on Service Systems and Service Management · 1
A Column Generation Method for the Parallel-Machine Scheduling Problem with availability constraint
2006 · Racem Mellouli, Cherif Sadfi, et al. · The Multiconference on Computational Engineering in Systems Applications · 1
An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
2014 · Walid Hfaiedh, Cherif Sadfi, et al. · International Conference on Control, Decision and Information Technologies (CoDIT)
Total weighted completion scheduling problem with availability constraints
2009 · Cherif Sadfi, Imed Kacem, et al. · International Conference on Computers and Industrial Engineering
Branch-and-Bound Method to solve the P/sub m/, h/sub j1/||/spl Sigma/C/sub i/ problem
2006 · Racem Mellouli, Cherif Sadfi, et al. · International Conference on Service Systems and Service Management
Branch-and-Bound Method tosolve thePm,h ECi problem
2006 · Chérif Sadfi, Chengbin Chu
MSPT2Heuristic andDynamic Programming Methodfor theParallel Machine Scheduling Problem withscheduled Preventive Maintenance
2006 · Chérif Sadfi, Chengbin Chu
A Column Generatlon Mlethod fortheParallel- Machine Schedullng Problem wlth availability constralnt
2006 · Chérif Sadfi, Chengbin Chu
Comparison of Heuristics for Solving a Flowshop Problem
2000 · Chérif Sadfi, Azita Karamipour, et al. · IFAC Proceedings Volumes
Works count: 23
Citation count: 293
H-index: 7
I10-index: 5
Year
Topic
Type