This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
en:publi [2013/10/06 09:39] – mserairi | en:publi [2014/06/11 11:50] – mserairi | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== Journal article ====== | ====== Journal article ====== | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
===== To appear ===== | ===== To appear ===== | ||
- | * 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, | + | |
+ | |||
+ | |||
+ | |||
+ | |||
+ | ===== 2014 ===== | ||
+ | | ||
+ | |||
Line 7: | Line 20: | ||
===== 2013 ===== | ===== 2013 ===== | ||
- | * 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 | + | * 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 |
* 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 231(1), 69-78, 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 231(1), 69-78, 2013 | ||
Line 15: | Line 28: | ||
* Haouari, M. and Serairi, M. **Heuristics for the variable sized bin-packing problem**. Computers & Operations Research 36 (10), 2877-2884, 2009 | * Haouari, M. and Serairi, M. **Heuristics for the variable sized bin-packing problem**. Computers & Operations Research 36 (10), 2877-2884, 2009 | ||
====== In proceedings ====== | ====== In proceedings ====== | ||
+ | |||
===== 2013 ===== | ===== 2013 ===== | ||
- | * 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. | + | * 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 à 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. | + | * 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 à Mousson, France June 23-28, 2013. |
===== 2012 ===== | ===== 2012 ===== | ||
* 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. **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. |