en:publi
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| en:publi [2013/10/05 21:07] – mserairi | en:publi [2020/02/05 10:33] (current) – mserairi | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Journal article ====== | + | < |
| - | ===== 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, to appear | + | |
| - | ===== 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 | + | |
| - | + | ||
| - | * 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 | + | |
| - | ===== 2011 ===== | + | |
| - | * 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 | + | |
| - | ===== 2009 ===== | + | |
| - | * Haouari, M. and Serairi, M. **Heuristics for the variable sized bin-packing problem**. Computers & Operations Research 36 (10), 2877-2884, 2009 | + | |
| - | + | ||
| - | ====== In proceedings ====== | + | |
| - | ===== 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. | + | |
| - | + | ||
| - | * 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. | + | |
| - | ===== 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. | + | |
| - | + | ||
| - | ===== 2010 ===== | + | |
| - | * 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 | + | |
Page Tools
en/publi.1381000046.txt.gz · Last modified: 2013/10/05 21:07 by mserairi
