- Home
- Faculty & Research
- Gur Mosheiov

**Research Interests: **

Combinatorial optimization, scheduling problems, routing, analysis of heuristics, exact algorithms, applications of operations research.

*Education*

**Ph.D.** Columbia University, 1991

*Positions*

Head of the MBA Program

*Publications*

**G. Mosheiov**. (1992). V-Shaped policies for scheduling deteriorating jobs. Operations Research, Vol. 39, No. 6, pp. 979-991.

A. Federgruen and **G. Mosheiov**. (1993). Simultaneous optimization of system-wide measures and measures of performance balance in single machine scheduling problems; a general planning framework. Naval Research Logistics, Vol. 40, pp. 951-970.

**G. Mosheiov**. (1994). The traveling salesman problem with pick-up and delivery. European Journal of Operational Research, Vol. 79, pp. 299-310.

**G. Mosheiov**. (1994). Scheduling jobs under simple linear deterioration. Computers and Operations Research, Vol. 21, No. 6, 653-659.

S. Anily. and **G. Mosheiov**. (1994). The traveling salesman problem with delivery and backhauls. Operations Research Letters, Vol. 16, pp. 11-18.

**G. Mosheiov**. (1994). Minimizing the sum of completion times on capacitated parallel machines. Mathematical and Computer Modelling, Vol. 20, No. 6, pp. 91-99.

A. Federgruen and **G. Mosheiov**. (1994). Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs. Operations Research Letters, 16, pp. 199-208.

A. Federgruen and **G. Mosheiov**. (1997). Single machine scheduling problems with general breakdowns, earliness and tardiness costs. Operations Research, 45, pp. 66-71.

**G. Mosheiov**. (1995). Scheduling jobs with step deterioration: minimizing makespan on a single- and multi-machine. Computers and Industrial Engineering, 28, pp. 869-879.

**G. Mosheiov**. (1995). The pick-up and delivery location problem on networks. Networks, 26, pp. 243-251.

**G. Mosheiov**. (1996). On preemptive scheduling with earliness and tardiness costs. Production, Planning and Control, 7, pp. 401-406.

A. Federgruen and **G. Mosheiov**. (1996). Heuristics for multi-machine scheduling problems with earliness and tardiness costs. Management Science, 42, pp. 1544-1556.

A. Lann and **G. Mosheiov**. (1996). Single Machine Scheduling to Minimize the Number of early/tardy jobs. Computers and Operations Research, 23, pp. 769-781.

**G. Mosheiov**. (1996). Λ-shaped policies to schedule deteriorating jobs. Journal of the Operational Research Society, 47, pp. 1184-1191.

**G. Mosheiov** and A. Raveh. (1997). On trend estimation of time-series: a simple linear programming approach. Journal of the Operational Research Society, 48, pp. 90-96.

A. Federgruen and **G. Mosheiov**. (1997). Heuristics for the multi-machine minmax scheduling problem with earliness and tardiness costs. Naval Research Logistics, 44, pp. 287-299.

**G. Mosheiov**. (1998). On the solution of the "Dream-League" game. Mathematical and Computer Modelling, 27, pp. 79-83.

**G. Mosheiov**. (1998). Vehicle routing with pick-up and delivery: tour-partitioning heuristics. Computers and Industrial Engineering, 34, pp. 669-684.

A. Lann, **G. Mosheiov** and Y. Rinott. (1998). Efficient heuristics for the parallel-processing open shop. Operations Research Letters, 22, pp. 63-68.

**G. Mosheiov**. (1998). Multi-machine scheduling with linear deterioration. INFOR, 36, pp. 205-214.

**G. Mosheiov**. (2001). A common due-date assignment problem on parallel identical machines. Computers and Operations Research, 28, pp. 719-732.

M. Mandel and **G. Mosheiov**. (2001). Minimizing maximum earliness on parallel machines. Computers and Operations Research, 28, pp. 317-327.

**G. Mosheiov**. (2000). Minimizing Mean Absolute Deviation from the Mean Completion Time. Naval Research Logistics, 47, pp. 657-668.

**G. Mosheiov** and M. Shadmon. (2001). Minmax earliness-tardiness costs with unit processing time jobs. European Journal of Operational Research, 130, pp. 638-652.

**G. Mosheiov**. (2001). Scheduling problems with learning effect. European Journal of Operational Research, 132, pp. 687-693.

**G. Mosheiov**. (2001). A due-window determination in minmax scheduling problems. INFOR, 39, pp. 107-123.

**G. Mosheiov**. (2002). The complexity of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics, 117, pp. 195-209.

**G. Mosheiov**. (2001). Parallel machine scheduling with a learning effect. Journal of the Operational Research Society, 52, pp. 1-5.

A. Lann and **G. Mosheiov**. (2003). Maximum number of on-time jobs on parallel identical machines. Computers and Operations Research, 30, pp. 1745-1749.

**G. Mosheiov** and J. Sidney. (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147, pp. 665-670.

M. Birman and **G. Mosheiov**. (2004). A note on a due-date assignment on a two-machine flow-shop. Computers and Operations Research, 31, pp. 473-480.

**G. Mosheiov**. (2003). Scheduling unit processing time jobs on an m-machine flow-shop. Journal of the Operational Research Society, 54, pp. 437-441.

**G. Mosheiov** and J. Sidney. (2003). New results on sequencing with rate modification. INFOR, 41, 155-163.

**G. Mosheiov** and D. Oron. (2004). A note on the SPT heuristic for solving scheduling problems with generalized due-dates. Computers and Operations Research, 31, pp. 645-655.

**G. Mosheiov**. (2004). Simultaneous minimization of total completion time and total deviation of job completion time. European Journal of Operational Research, 157, pp. 296-306.

**G. Mosheiov** and U. Yovel. (2004). Comments on: "Flow shop and open shop scheduling with a critical machine and two operations per job". European Journal of Operational Research, 157, pp. 257-261.

**G. Mosheiov**. Due-date assignment with asymmetric earliness-tardiness cost. Journal of the Operational Research Society, 54, pp. 1222-1224.

**G. Mosheiov** and D. Oron. (2005). A note on flow-shop and job-shop batch scheduling with identical processing-time jobs. European Journal of Operational Research, 161, pp. 285-291.

**G. Mosheiov**, D. Oron and Y. Ritov. (2004). Flow-shop batch scheduling to minimize total flow-time. NRL, 51, pp. 783-799.

**G. Mosheiov**. (2005). Minimizing total completion time and total deviation of job completion time from a common restrictive due-date. European Journal of Operational Research, 165, pp. 20-33.

**G. Mosheiov** and J. Sidney. (2005). A note on scheduling with learning effect to minimize the number of tardy jobs. Journal of the Operational Research Society, 56, pp. 110-112.

**G. Mosheiov** and D. Oron. (2004). Due-window assignment with unit processing time jobs. Naval Research Logistics, pp. 1005-1017.

**G. Mosheiov**. A note on scheduling deteriorating jobs. (2005). Mathematical and Computer Modelling, 41, pp. 883-886.

**G. Mosheiov**, D. Oron and Y. Ritov. (2005). Minimizing flow-time on a single machine with integer batch sizes. Operations Research Letters, 33, pp. 497-501.

**G. Mosheiov** and U. Yovel. (2006). Minimizing weighted earliness-tardiness and due-date cost with unit processing time jobs. European Journal of Operational Research, 172, pp. 528-544.

**G. Mosheiov** and D. Oron. (2007). Minmax scheduling with job-classes and earliness-tardiness costs. European Journal of Operational Research, 177, pp. 612-622.

**G. Mosheiov** and D. Oron. (2006). A Note on Batch Scheduling with Sequence-Dependent Setup Times. Information Processing Letters, 98, pp. 73-78.

**G. Mosheiov** and D. Oron. (2006). Due-date assignment and maintenance activity scheduling problem. Mathematical and Computer Modeling, 44, pp. 1053-1057.

**G. Mosheiov** and D. Oron. (2008). A single machine batch scheduling problem with bounded batch size. European Journal of Operational Research, 187, pp. 1069-1079.

**G. Mosheiov** and D. Oron. (2008). An m-machine open shop batch scheduling to minimize makespan. European Journal of Operational Research, 187, pp. 1282-1292.

**G. Mosheiov** and D. Baraz. (2008). A note on a greedy heuristic for flowshop makespan minimization with no machine idle-time. European Journal of Operational Research, 184, pp. 810-813.

**G. Mosheiov** and A. Sarig. (2007). A Due-window assignment problem with position-dependent processing times. Journal of the Operational Research Society, 57, pp. 997-1003.

C.-L. Li, **G. Mosheiov** and U. Yovel. (2008). An efficient algorithm for minimizing earliness, tardiness and due-date costs for equal-sized jobs. Coputers and Operations Research, 35, pp. 3612-3619.

**G. Mosheiov**. (2007). Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines. Journal of the Operational Research Society, 59, pp. 1422-1424.

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

**G. Mosheiov** and A. Sarig. (2009). Minmax Scheduling Problems with a Common Due-Window. Computers and Operations Research, 36, pp. 1886-1892.

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

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

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

**G. Mosheiov** and A. Sarig. (2009). Scheduling a maintenance activity to minimize weighted flow-time. Computers and Mathematics with Applications, 57, pp. 619-623.

**G. Mosheiov** and A. Sarig. (2009). Scheduling a maintenance activity on unrelated machines. Computers and Operations Research, 36, pp. 2759-2762.

**G. Mosheiov** and J. Sidney. (2010). Scheduling a deteriorating maintenance activity on a single machine. Journal of the Operational Research Society, 61, pp. 882-867.

**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, pp. 404-408.

**G. Mosheiov** and A. Sarig. (2010). Scheduling identical jobs and due-window assignment on uniform machines. European Journal of Operational Research, 201, pp. 712-719.

**G. Mosheiov** and A. Sarig. (2009). Scheduling and due-date assignment problems with job rejection. Foundations of Computing and Decision Sciences, 34, pp. 193-208.

L. Ben-Dati, **G. Mosheiov** and D. Oron. (2009). Batch scheduling on a two-machine flow-shop with machine-dependent setup times. Advances in Operations Research, doi: 10.1155/2009/153910.

**G. Mosheiov** and A. Sarig. (2011). A Note: A due-window assignment problem on parallel identical machines. Journal of the Operational Research Society, 62, pp. 238-241.

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

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

B. Mor and **G. Mosheiov**. (2010). Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. European Journal of Operational Research, 206, pp. 540-546.

**G. Mosheiov** and D. Oron. (2010). Job dependent due-window assignment based on a common flow allowance. Foundations of Computing and Decision Sciences, 35, pp. 185-195.

B. Mor and **G. Mosheiov**. (2011). Total absolute deviation of job completion times on uniform and unrelated machines. Computers and Operations Research, 38, pp. 660-665.

**G. Mosheiov**. (2011). Proportionate flowshop with general position-dependent processing times. Information Processing Letters, 111, pp. 174-177.

B. Mor, **G. Mosheiov** and D. Oron. (2012). The equal allocation policy in openshop batch scheduling. Journal of the Operational Research Society, 63, pp. 646-652.

**G. Mosheiov** and D. Oron. (2011). Batch scheduling on a two-machine jobshop with machine-dependent setup times. Naval Research Logistics, 58, pp. 676-684.

B. Mor and **G. Mosheiov**. (2011). Single machine batch scheduling with two competing agents to minimize total flowtime. European Journal of Operational Research, 215, pp. 524-531.

B. Mor and **G. Mosheiov**. (2011). Batch scheduling on uniform machines to minimize total flow-time. Computers and Operations Research, 39, pp. 571-575.

**G. Mosheiov**. (2012). A note: multi-machine scheduling with general position-based deterioration to minimize total load. International Journal of Production Economics, 135, pp. 523-535.

B. Mor and **G. Mosheiov**. (2012). Scheduling a maintenance activity and due-window assignment based on common flow-allowance. International Journal of Production Economics, 135, pp. 222-230.

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

**G. Mosheiov** and D. Oron. (2012). Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times. Computers and Operations Research, 39, pp. 1601-1604.

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.

B. Mor and **G. Mosheiov**. (2012). Minmax scheduling problems with common flow-allowance. Journal of the Operational Research Society, 63, pp. 1284-1293.

B. Mor and **G. Mosheiov**. (2012). Heuristics for scheduling problems with unavailability constraints and position-dependent processing times. Computers and Industrial Engineering, 62, pp. 908-916.

B. Mor and **G. Mosheiov**. (2012). Parallel machine scheduling problems with common flow allowance. International Journal of Production Economics, 139, pp. 623-633.

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.

B. Mor and **G. Mosheiov**. (2012). Batch scheduling of identical jobs on parallel identical machines. Information Processing Letters, 112, pp. 762-766.

**G. Mosheiov** and D. Shabtay. (2013). Maximizing the weighted number of Just-In-Time jobs on a single machine with position-dependent processing times. Journal of Scheduling. 16, pp. 519-527.

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.

B. Mor and **G. Mosheiov**. (2012). Batch scheduling with step-deteriorating processing times to minimize flowtime. Naval Research Logistics, 59, pp. 587-600.

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.

B. Mor and **G. Mosheiov**. (2014). Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. Journal of the Operational Research Society, 65, pp. 151-157. (Was chosen by the editorial board of JORS as one of the "10 influential articles" of the journal, 2013)

B. Mor, **G. Mosheiov** and D. Shabtay. (2013). A Note: Minmax due-date assignment problem with lead-time cost. Computers and Operations Research, 40, pp. 2161-2164.

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**. (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**. (2013). A two-stage flow shop batch scheduling problem with the option of using Not-All-Machines. Internationl Journal of Production Economics. 146, pp. 161-166.

B. Mor and **G. Mosheiov**. (2014). Batch scheduling of identical jobs with controllable processing times. Computers and Operations Research, 41, pp. 115-124.

E. Gerstl, **G. Mosheiov** and A. Sarig. (2014). Batch scheduling in a two stage flexible flowshop problem. Foundations of Computing and Decision Sciences, 39, pp. 3-16.

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

E. Gerstl and **G. Mosheiov**. (2014). Single machine Just-in-Time scheduling problems with two competing agents. Naval Research Logistics, 61, pp. 1-16.

B. Mor and **G. Mosheiov**. (2014). Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime. International Journal of Production Economics, 153, 238-242.

E. Gerstl and **G. Mosheiov**. (2014). A two-stage flexible flowshop 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, 159-162.

B. Mor and **G. Mosheiov**. (2015). A note: minimizing maximum earliness on a propotrionate flowshop. Information Processing Letters, 115, 253-255.

B. Mor and **G. Mosheiov**. (2015). Minimizing the number of early jobs on a proportionate flowshop. Journal of the Operational Research Society, 66, 1426-1429.

B. Mor and **G. Mosheiov**. (2015). Scheduling a deteriorating maintenance activity and due-window assignment. Computers and Operations Research, 57, 33-40.

Y. Ben-Yehoshua, E. Hariri and **G. Mosheiov**. (2015). A note on minimising total absolute deviation of job completion times on a two-machine no-wait proportionate flowshop. International Journal of Production Research, 53, 5717-5724.

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

Y. Ben-Yehoshua and **G. Mosheiov**. (2016). A single machine scheduling problem to minimize total early work. Computers and Operations Research, 73, 115-118.

B. Mor and **G. Mosheiov**. (2016). Minsum and minmax scheduling on a proportionate flowshop with common flow allowance. European Journal of Operational Research, 254, 360-370.

B. Mor and **G. Mosheiov**. (2016). Minimizing maximum cost on a single machine with two competing agents and job rejection. Journal of the Operational Research Society, 67, 1524-1531.

B. Mor and **G. Mosheiov**. (2017). A two-agent single machine scheduling problem with due-window assignment and common flow allowance. Journal of Combinatorial Optimization, 33, 1454-1468.

E. Gerstl and **G. Mosheiov**. (2017). Single machine scheduling problems with generalized due-dates and job-rejection. International Journal of Production Research, 55, 3164-3172.

A. Agnetis and **G. Mosheiov**. (2017). Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optimization Letters, 11, 885-892.

E. Gerstl, B. Mor and **G. Mosheiov**. (2017). Scheduling with two competing agents to minimize total weighted earliness. Annals of Operations Research, 253, 227-245.

E. Gerstl, B. Mor and **G. Mosheiov**. (2017). Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection. Computers and Operations Research, 83, 150-156.

E. Gerstl and **G. Mosheiov**. (2017). Minmax weighted earliness-tardiness with identical processing times and two competing agents. Computers and Industrial Engineering, 107, 171-177.

**G. Mosheiov** and V. Strusevich. (2017). Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow. Naval Research Logistics, 64, 217-224.

S. Fiscman and **G. Mosheiov**. (2018). minimizing total load on a proportionate flowshop with position-dependent processing times and job rejection. 132, 39-43.

B. Mor and **G. Mosheiov**. (2018). A Note: Minimizing Total Absolute Deviation of job Completion times on unrelated machines with general position-dependent processing times and job-rejection. To appear in Annals of Operations Research.

*Honors And Awards*

**Research and Teaching Awards**

- Received the * Rector's Prize of The Hebrew University of 2003* for "excellent researcher".

- Received the ** Rector's (Milken) Prize of The Hebrew University of 2015** for "long standing excellence in teaching".

*CV*

*Personal Web Site*