Moukrim, A. and Rebaine, D. and Serairi, M. A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays. RAIRO-Operations Research, to appear

Oulamara, A. and Rebaine, D. and Serairi, M. Scheduling the two-machine open shop problem under resource constraints for setting the jobs. Annals of Operations Research, 1-24, 2013

Gharbi, A. and Ladhari, T. and Msakni, M.K. and Serairi, M. The Two-Machine Flowshop Scheduling Problem with Sequence-Independent Setup Times: New Lower Bounding Strategies. European Journal of Operational Research, 2013

Haouari, M. and Serairi M. Relaxations and exact solution of the variable sized bin packing problem. Computational Optimization and Applications 48 (2), 345-368, 2011

Haouari, M. and Serairi, M. Heuristics for the variable sized bin-packing problem. Computers & Operations Research 36 (10), 2877-2884, 2009

Kooli, A. and Serairi, M. An assignment based lower bound for the single machine with unequal release dates. The 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Pont a Mousson, France June 23-28, 2013.

Oulamara, A. and Rebaine, D. and Serairi, M. Open shop scheduling problem with time- dependent resource consumption. The 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Pont a Mousson, France June 23-28, 2013.

Gharbi, A. and Ladhari, T. and Msakni, M.K. and Serairi M. Tight lower bounds for the two- machine flowshop scheduling problem with setup times. 13th International Conference on Project Management and Scheduling (PMS), Leuven Belgium April 1-4, 2012.

Gharbi, A. and Ladhari, T. and Msakni, M.K. and Serairi, M. Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times. Electronic Notes in Discrete Mathematics 36, 1089-1096, 2010

Serairi, M. and Haouari, M. A Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem. Electronic Notes in Discrete Mathematics 36, 891-897, 2010