גרסטל

לפרטים על תואר ראשון ושני

למידע נוסף על לימודים אקדמיים בלבד השאירו פרטיכם ונחזור בהקדם

ראשי » גרסטל
`ד"ר גרסטל צבי,
מרצה
  • בתיאום מראש

Curriculum Vitae
קורות חיים

Education

PhD., Operations Research, The Hebrew University. (2009-2013)

  • Dissertation: Exact algorithms and heuristics for solving deterministic scheduling problems. Eleven papers were published in top academic journals in Computers and Operations Research.

Executive MBA, cum laude, The Hebrew University. (2006-2008)

  • Dissertation: How much does technological knowledge transfer matter for R&D location?

BSc., Physics, The Hebrew University. (1996-2001)

 

Work Experience

  • Senior Director, Cisco (2015 to present)
  • Cisco Director, Cisco (2013-2015)
  • NDS Development Vice President, NDS (2007-2013)
  • Group Leader and Program Manager, NDS (2000-2007)
  • Software Engineer, NDS (1997-2000)
 

Awards

  • 2014: Wolf Foundation – award for excellence in PhD contribution (scheduling algorithms)
  • 2005: NEWS Corp Global excellence award
  • 2003: NDS CEO award for the outstanding technical contribution on the Pay-TV market

 

Publications

E. Gerstl and G. Mosheiov. (2012). Scheduling job classes on uniform machines. Computers and Operations Research39, pp. 1927-1932.

E. Gerstl and G. Mosheiov. (2012). A two-stage flowshop with a critical machine and batch availability. Foundations of Computing and Decision Sciences37, pp. 39-56.

E. Gerstl and G. Mosheiov. (2013). Scheduling problems with two competing agents to minimize weighted earliness-tardiness. Computers and Operations Research40, pp. 109-116.

E. Gerstl and G. Mosheiov. (2012). Scheduling on parallel identical machines with job rejection and position-dependent processing times.Information Processing Letters112, pp. 743-747.

E. Gerstl and G. Mosheiov. (2013). Due-window assignment with identical jobs on parallel uniform machines. European Journal of Operational Research229, pp. 41-47.

E. Gerstl and G. Mosheiov. (2013). Due-window assignment problems with unit time jobs. Applied Mathematics and Computation220, pp. 487-495.

E. Gerstl and G. Mosheiov. (2013). An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs.Information Processing Letters113, pp. 754-759.

E. Gerstl and G. Mosheiov. (2013). The optimal number of used machines in a two-stage flexible flow shop scheduling problem. To appear in the Journal of Scheduling, DOI: 10.1007/s10951-013-0343-z.

E. Gerstl and G. Mosheiov. (2013). A two-stage flow shop batch scheduling problem with the option of using Not-All-Machines. Internationl Journal of Production Economics146, pp. 161-166.

E. Gerstl and G. Mosheiov. (2013). Minmax due-date assignment with a time window foe acceptable lead-times. Annals of Operations Research211, pp. 167-177.

E. Gerstl and G. Mosheiov. (2014). Single Machine Just-in-Time Scheduling Problems with Two Competing Agents. Naval Research Logistics61, pp. 1-16.

E. Gerstl and G. Mosheiov. (2014). Batch Scheduling in A Two-Stage Flexible Flow Shop Problem. Foundations of Computing and Decision Sciences39, pp. 3-16.

E. Gerstl and G. Mosheiov. (2014). A two-stage flexible flow shop problem with unit-execution-time jobs and batching. International Journal of Production Economics158, pp. 171-178.

E. Gerstl, B. Mor and G. Mosheiov. (2015). A note: maximizing the weighted number of just-in-time jobs on a proportionate flowshop.Information Processing Letters115, pp. 159-162.

E. Gerstl and G. Mosheiov. (2015). Scheduling with a due-window for acceptable lead-times. Journal of the Operational Research Society66, 1578-1588.

E. Gerstl, B. Mor and G. Mosheiov. (2016). Scheduling with two competing agents to minimize total weighted earliness. To be published inAnnals of Operations Research.

E. Gerstl and G. Mosheiov. (2016). Single machine scheduling problems with generalized due-dates and job-rejection. To be published inInternational Journal of Production Research.

E. Gerstl, B. Mor and G. Mosheiov.Gerstl (2016) Scheduling with two competing agents to minimize total weighted earliness. Annals of Operations Research (2016): 1-19.

 

Working Papers

E. Gerstl. Scheduling with the option of Not-All-Machines and job rejection.

E. Gerstl and G. Mosheiov. Minmax scheduling with acceptable lead-times: extensions to position- dependent processing times, due-window and job rejection

E. Gerstl and G. Mosheiov. Single machine to minimize total earliness-tardiness with unavailability period

E. Gerstl and G. Mosheiov. Minmax Weighted Earliness-Tardiness with Identical Processing Times and Two Competing Agents

 

Conferemces

Orsis 2011, – Scheduling: A two-stage flow-shop scheduling with a critical machine and batch availability Orsis 2012, Jerusalem – Scheduling: Due-window for acceptable lead times

Orsis 2013, Beer Sheva – The optimal number of used machines in a two-stage flow-shop scheduling problem

EURO XXVI, Rome – The optimal number of used machines in a two-stage flow-shop scheduling problem

Orsis 2014, Tel Aviv – A two-stage flexible flow shop with unit-execution-time jobs and batching

Orsis 2015, Haifa – Parallel Machine Just-in-Time Scheduling Problems with Unit time Jobs

Orsis 2016, Maale Hachamisha – Single machine to minimize total earliness-tardiness with unavailability period

 

Courses

  • Facilities layout design
  • Operational Research for Business Management I