en:publi
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | Last revisionBoth sides next revision | ||
| en:publi [2014/06/11 11:46] – mserairi | en:publi [2014/06/11 11:50] – mserairi | ||
|---|---|---|---|
| Line 13: | Line 13: | ||
| ===== 2014 ===== | ===== 2014 ===== | ||
| * 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 48(2), 235-254, 2014 | * 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 48(2), 235-254, 2014 | ||
| + | |||
| Line 19: | 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 | + | * 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 | ||
Page Tools
en/publi.txt · Last modified: 2020/02/05 10:33 by mserairi
