תפריט נוסף
חזרה
ד"ר אסף שריג

מספר חדר: 418

 

 

דוא"ל: assaf.s@clb.ac.il

ד"ר לסטטיסטיקה מהאוניברסיטה העברית בירושלים, התמחות בחקר ביצועים בתחום של תזמון דטרמיניסטי. הדוקטורט אושר במרץ 2010. כיום ד"ר אסף שריג מרצה במרכז האקדמי למשפט ועסקים ובאוניברסיטה העברית בירושלים.

1. G. Mosheiov and A. Sarig (2007). A Due-date assignment problem with position-dependent processing times. Journal of the Operational Research Society 59: 997-1003.

2. G. Mosheiov and A. Sarig (2008). A Multi-criteria scheduling with due-window assignment problem. Mathematical and Computer Modeling 48: 898-907.

3. G. Mosheiov and A. Sarig (2009). Minmax scheduling problems with a common due-window. Computers and Operations Research 36: 1886-1892.

4. G. Mosheiov and A. Sarig (2009). Due-date assignment on uniform machines. European Journal of Operational Research 193: 49-58.

5. A. Levin, G. Mosheiov and A. Sarig (2009). Scheduling a maintenance activity on parallel identical machines. Naval Research Logistics 56: 33-41

6. G. Mosheiov and A. Sarig (2009). Scheduling a maintenance activity and due-window assignment on a single machine. Computers and Operations Research 36: 2541-2545.

7. G. Mosheiov and A. Sarig (2009). Scheduling a maintenance activity to minimize total weighted completion-time. Computers and Mathematics with Applications 57: 619-623.

8. G. Mosheiov and A. Sarig (2009). A note: Simple heuristics for scheduling a maintenance activity on unrelated machines. Computers and Operations Research 36: 2759-2762.

9. G. Mosheiov and A. Sarig (2009). A due-date assignment problem with job rejection. Foundation of Computing and Decision Sciences 34.

10. G. Mosheiov and A. Sarig (2009). A note: A due-window assignment problem on parallel identical machines. Journal of the Operational Research Society.

11. G. Mosheiov and A. Sarig (2009). Scheduling with a common due-window: polynomially solvable cases. Information Sciences 180: 1492-1505.

12. G. Mosheiov and A. Sarig (2010). Minimum weighted number of tardy jobs on an

m-machine flow shop with a critical machine. European Journal of Operational Research 201: 404-408.

13. G. Mosheiov and A. Sarig (2010). Scheduling identical jobs and a due-window on uniform machines. European Journal of Operational Research 201: 712-719

14. G. Mosheiov, A. Sarig and J. Sidney (2010). The Browne-Yechiali single-machine sequence is optimal for flow-shops. Computers and Operations Research 37: 1965-1967.

15. E. Gerstl, G. Mosheiov, and A. Sarig, (2014). Batch scheduling in a two-stage flexible flow shop problem. Foundations of Computing and Decision Sciences 39 (1): 3-16

16. G. Mosheiov, A. Sarig and V. Strusevitch (2016). Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. Accepted to 4OR.

17. G. Mosheiov, A. Sarig, V. Strusevitch and Jonathan Mosheiff (2018). Two-Machine Flow Shop and Open Shop Scheduling Problems with a Single Maintenance Window. European Journal of Operational Research 271 (2): 388-400.

18. G. Mosheiov and A. Sarig (2019). Batch scheduling problems with job rejection. Submitted to Annals of operations Research.

לרשימה המלאה צמצם
מתמטיקה א'
מתמטיקה ב'
סטטיסטיקה א'
סטטיסטיקה ב'
מבוא לסטטיסטיקה (מערכות בריאות)
שיטות מתקדמות ויישומים סטטיסטיים (מערכות בריאות)
Fields marked with an * are required

פגישת ייעוץ אישי חינם

אנחנו מזמינים אתכם להשאיר פרטים ואחד מיועצי הלימודים שלנו ישמח לחזור אליכם

בניית אתרים | חווית משתמש | פיתוח תוכנה