Tzvi Gerstl

Tzvi (Enrique) Gerstl holds a BSc in Physics and an MBA, all from the Hebrew University. Tzvi received his PhD in Operations Research under the tutelage of Professor Gur Mosheiov. Tzvi’s main research interest is in algorithms and deterministic scheduling. In 2013, Tzvi joined Cisco as an Executive Director, after he had had worked 15 years for NDS. Tzvi's last position at NDS was Software Development Vice President.

Publications

• E. Gerstl and G. Mosheiov. (2012). Scheduling job classes on uniform machines. Computers and Operations Research, 39, 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 Sciences, 37, pp. 39-56.
• E. Gerstl and G. Mosheiov. (2012). Scheduling on parallel identical machines with job rejection and position-dependent processing times. Information Processing Letters, 112, pp. 743-747.
• E. Gerstl and G. Mosheiov. (2013). Scheduling problems with two competing agents to minimize weighted earliness-tardiness. Computers and Operations Research, 40, pp. 109-116.
• E. Gerstl and G. Mosheiov. (2013). Due-window assignment with identical jobs on parallel uniform machines. European Journal of Operational Research, 229, pp. 41-47.
• E. Gerstl and G. Mosheiov. (2013). Due-window assignment problems with unit time jobs.Applied Mathematics and Computation, 220, 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 Letters, 113, pp. 754-759.
• E. Gerstl and G. Mosheiov. (2013). A two-stage flow shop batch scheduling problem with the option of using Not-All-Machines. International Journal of Production Economics, 146, pp. 161-166.
• E. Gerstl and G. Mosheiov. (2013). Minmax due-date assignment with a time window foe acceptable lead-times. Annals of Operations Research, 211, pp. 167-177.
• E. Gerstl and G. Mosheiov. (2014). The optimal number of used machines in a two-stage flexible flow shop scheduling problem. Journal of Scheduling, 17, pp. 199-210.
• E. Gerstl and G. Mosheiov. (2014). Single Machine Just-in-Time Scheduling Problems with Two Competing Agents.Naval Research Logistics, 61, pp. 1-16.
• E. Gerstl, G. Mosheiov and G. Mosheiov. (2014). Batch Scheduling In A Two-Stage Flexible Flow Shop Problem. Foundations of Computing and Decision Sciences, 39, 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 Economics, 158, 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 Letters, 115, pp. 159-162.
• E. Gerstl, B. Mor and G. Mosheiov. (2015). Scheduling with a due-window for acceptable lead-times. To be published in Journal of the Operational Research Society

CONFERENCES

• 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

Awards

• 2014: Wolf Foundation – award for excellence in PhD contribution (scheduling algorithms)