V-Shaped Policies for Scheduling Deteriorating Jobs. - Gur Mosheiov (Oper. Res., 1991)

Scheduling jobs under simple linear deterioration. - Gur Mosheiov (Comput. Oper. Res., 1994)

The traveling salesman problem with delivery and backhauls. - Shoshana Anily; Gur Mosheiov (Oper. Res. Lett., 1994)

Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs. - Awi Federgruen; Gur Mosheiov (Oper. Res. Lett., 1994)

The pickup delivery location problem on networks. - Gur Mosheiov (Networks, 1995)

Single machine scheduling to minimize the number of early and tardy jobs. - Avital Lann; Gur Mosheiov (Comput. Oper. Res., 1996)

Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs. - Awi Federgruen; Gur Mosheiov (Oper. Res., 1997)

Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps. - Avital Lann; Gur Mosheiov; Yosef Rinott (Oper. Res. Lett., 1998)

Minimizing maximum earliness on parallel identical machines. - Micha Mandel; Gur Mosheiov (Comput. Oper. Res., 2001)

A common due-date assignment problem on parallel identical machines. - Gur Mosheiov (Comput. Oper. Res., 2001)

Scheduling problems with a learning effect. - Gur Mosheiov (Eur. J. Oper. Res., 2001)

Minmax earliness-tardiness costs with unit processing time jobs. - Gur Mosheiov; Michal Shadmon (Eur. J. Oper. Res., 2001)

Parallel machine scheduling with a learning effect. - Gur Mosheiov (J. Oper. Res. Soc., 2001)

Complexity analysis of job-shop scheduling with deteriorating jobs. - Gur Mosheiov (Discret. Appl. Math., 2002)

A note on the maximum number of on-time jobs on parallel identical machines. - Avital Lann; Gur Mosheiov (Comput. Oper. Res., 2003)

Scheduling with general job-dependent learning curves. - Gur Mosheiov; Jeffrey B. Sidney (Eur. J. Oper. Res., 2003)

Scheduling unit processing time jobs on an m-machine flow-shop. - Gur Mosheiov (J. Oper. Res. Soc., 2003)

Due-date assignment with asymmetric earliness-tardiness cost. - Gur Mosheiov (J. Oper. Res. Soc., 2003)

A note on a due-date assignment on a two-machine flow-shop. - Motty Birman; Gur Mosheiov (Comput. Oper. Res., 2004)

A note on the SPT heuristic for solving scheduling problems with generalized due dates. - Gur Mosheiov; Daniel Oron (Comput. Oper. Res., 2004)

Simultaneous minimization of total completion time and total deviation of job completion times. - Gur Mosheiov (Eur. J. Oper. Res., 2004)

Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job". - Gur Mosheiov; Uri Yovel (Eur. J. Oper. Res., 2004)

Minimizing total completion time and total deviation of job completion times from a restrictive due-date. - Gur Mosheiov (Eur. J. Oper. Res., 2005)

A note on flow-shop and job-shop batch scheduling with identical processing-time jobs. - Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2005)

Note on scheduling with general learning curves to minimize the number of tardy jobs. - Gur Mosheiov; Jeffrey B. Sidney (J. Oper. Res. Soc., 2005)

A note on scheduling deteriorating jobs. - Gur Mosheiov (Math. Comput. Model., 2005)

Minimizing flow-time on a single machine with integer batch sizes. - Gur Mosheiov; Daniel Oron; Yaacov Ritov (Oper. Res. Lett., 2005)

Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs. - Gur Mosheiov; Uri Yovel (Eur. J. Oper. Res., 2006)

Single machine scheduling with batch-dependent setup times. - Gur Mosheiov; Daniel Oron (Inf. Process. Lett., 2006)

Due-date assignment and maintenance activity scheduling problem. - Gur Mosheiov; Daniel Oron (Math. Comput. Model., 2006)

Minmax scheduling with job-classes and earliness-tardiness costs. - Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2007)

An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs. - Chung-Lun Li; Gur Mosheiov; Uri Yovel (Comput. Oper. Res., 2008)

A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time. - Daniel Baraz; Gur Mosheiov (Eur. J. Oper. Res., 2008)

A single machine batch scheduling problem with bounded batch size. - Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2008)

Open-shop batch scheduling with identical jobs. - Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2008)

Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines. - Gur Mosheiov (J. Oper. Res. Soc., 2008)

A due-window assignment problem with position-dependent processing times. - Gur Mosheiov; Assaf Sarig (J. Oper. Res. Soc., 2008)

A multi-criteria scheduling with due-window assignment problem. - Gur Mosheiov; Assaf Sarig (Math. Comput. Model., 2008)

Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times. - Lika Ben-Dati; Gur Mosheiov; Daniel Oron (Adv. Oper. Res., 2009)

Scheduling a maintenance activity to minimize total weighted completion-time. - Gur Mosheiov; Assaf Sarig (Comput. Math. Appl., 2009)

Minmax scheduling problems with a common due-window. - Gur Mosheiov; Assaf Sarig (Comput. Oper. Res., 2009)

Scheduling a maintenance activity and due-window assignment on a single machine. - Gur Mosheiov; Assaf Sarig (Comput. Oper. Res., 2009)

A note: Simple heuristics for scheduling a maintenance activity on unrelated machines. - Gur Mosheiov; Assaf Sarig (Comput. Oper. Res., 2009)

Erratum to "A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time" [European Journal of Operational Research, 184 (2) (2008), 810-813]. - Daniel Baraz; Gur Mosheiov (Eur. J. Oper. Res., 2009)

Due-date assignment on uniform machines. - Gur Mosheiov; Assaf Sarig (Eur. J. Oper. Res., 2009)

The Browne-Yechiali single-machine sequence is optimal for flow-shops. - Gur Mosheiov; Assaf Sarig; Jeffrey B. Sidney (Comput. Oper. Res., 2010)

Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. - Baruch Mor; Gur Mosheiov (Eur. J. Oper. Res., 2010)

Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine. - Gur Mosheiov; Assaf Sarig (Eur. J. Oper. Res., 2010)

Scheduling identical jobs and due-window on uniform machines. - Gur Mosheiov; Assaf Sarig (Eur. J. Oper. Res., 2010)

Scheduling with a common due-window: Polynomially solvable cases. - Gur Mosheiov; Assaf Sarig (Inf. Sci., 2010)

Scheduling a deteriorating maintenance activity on a single machine. - Gur Mosheiov; Jeffrey B. Sidney (J. Oper. Res. Soc., 2010)

Total absolute deviation of job completion times on uniform and unrelated machines. - Baruch Mor; Gur Mosheiov (Comput. Oper. Res., 2011)

Single machine batch scheduling with two competing agents to minimize total flowtime. - Baruch Mor; Gur Mosheiov (Eur. J. Oper. Res., 2011)

Proportionate flowshops with general position-dependent processing times. - Gur Mosheiov (Inf. Process. Lett., 2011)

A note: a due-window assignment problem on parallel identical machines. - Gur Mosheiov; Assaf Sarig (J. Oper. Res. Soc., 2011)

Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times. - Baruch Mor; Gur Mosheiov (Comput. Ind. Eng., 2012)

Scheduling job classes on uniform machines. - Enrique Gerstl; Gur Mosheiov (Comput. Oper. Res., 2012)

Batch scheduling on uniform machines to minimize total flow-time. - Baruch Mor; Gur Mosheiov (Comput. Oper. Res., 2012)

Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times. - Gur Mosheiov; Daniel Oron (Comput. Oper. Res., 2012)

Scheduling on parallel identical machines with job-rejection and position-dependent processing times. - Enrique Gerstl; Gur Mosheiov (Inf. Process. Lett., 2012)

Batch scheduling of identical jobs on parallel identical machines. - Baruch Mor; Gur Mosheiov (Inf. Process. Lett., 2012)

Minmax scheduling problems with common flow-allowance. - Baruch Mor; Gur Mosheiov (J. Oper. Res. Soc., 2012)

The equal allocation policy in open shop batch scheduling. - Baruch Mor; Gur Mosheiov; Daniel Oron (J. Oper. Res. Soc., 2012)

Due-window assignment problems with unit-time jobs. - Enrique Gerstl; Gur Mosheiov (Appl. Math. Comput., 2013)

Minmax due-date assignment with a time window for acceptable lead-times. - Enrique Gerstl; Gur Mosheiov (Ann. Oper. Res., 2013)

Scheduling problems with two competing agents to minimized weighted earliness-tardiness. - Enrique Gerstl; Gur Mosheiov (Comput. Oper. Res., 2013)

A note: Minmax due-date assignment problem with lead-time cost. - Baruch Mor; Gur Mosheiov; Dvir Shabtay (Comput. Oper. Res., 2013)

Due-window assignment with identical jobs on parallel uniform machines. - Enrique Gerstl; Gur Mosheiov (Eur. J. Oper. Res., 2013)

An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs. - Enrique Gerstl; Gur Mosheiov (Inf. Process. Lett., 2013)

Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times. - Gur Mosheiov; Dvir Shabtay (J. Sched., 2013)

Batch scheduling of identical jobs with controllable processing times. - Baruch Mor; Gur Mosheiov (Comput. Oper. Res., 2014)

Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. - Baruch Mor; Gur Mosheiov (J. Oper. Res. Soc., 2014)

The optimal number of used machines in a two-stage flexible flowshop scheduling problem. - Enrique Gerstl; Gur Mosheiov (J. Sched., 2014)

Scheduling a deteriorating maintenance activity and due-window assignment. - Baruch Mor; Gur Mosheiov (Comput. Oper. Res., 2015)

A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. - Enrique Gerstl; Baruch Mor; Gur Mosheiov (Inf. Process. Lett., 2015)

A note: Minimizing maximum earliness on a proportionate flowshop. - Baruch Mor; Gur Mosheiov (Inf. Process. Lett., 2015)

Scheduling with a due-window for acceptable lead-times. - Enrique Gerstl; Gur Mosheiov (J. Oper. Res. Soc., 2015)

Minimizing the number of early jobs on a proportionate flowshop. - Baruch Mor; Gur Mosheiov (J. Oper. Res. Soc., 2015)

A single machine scheduling problem to minimize total early work. - Yoav Ben-Yehoshua; Gur Mosheiov (Comput. Oper. Res., 2016)

Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. - Baruch Mor; Gur Mosheiov (Eur. J. Oper. Res., 2016)

Minimizing maximum cost on a single machine with two competing agents and job rejection. - Baruch Mor; Gur Mosheiov (J. Oper. Res. Soc., 2016)

Scheduling with two competing agents to minimize total weighted earliness. - Enrique Gerstl; Baruch Mor; Gur Mosheiov (Ann. Oper. Res., 2017)

Minmax weighted earliness-tardiness with identical processing times and two competing agents. - Enrique Gerstl; Gur Mosheiov (Comput. Ind. Eng., 2017)

Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection. - Enrique Gerstl; Baruch Mor; Gur Mosheiov (Comput. Oper. Res., 2017)

Single machine scheduling problems with generalised due-dates and job-rejection. - Enrique Gerstl; Gur Mosheiov (Int. J. Prod. Res., 2017)

A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. - Baruch Mor; Gur Mosheiov (J. Comb. Optim., 2017)

Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. - Alessandro Agnetis; Gur Mosheiov (Optim. Lett., 2017)

A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection. - Baruch Mor; Gur Mosheiov (Ann. Oper. Res., 2018)

Two-machine flow shop and open shop scheduling problems with a single maintenance window. - Gur Mosheiov; Assaf Sarig; Vitaly A. Strusevich; Jonathan Mosheiff (Eur. J. Oper. Res., 2018)

Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection. - Shir Fiszman; Gur Mosheiov (Inf. Process. Lett., 2018)

Scheduling on a proportionate flowshop to minimise total late work. - Enrique Gerstl; Baruch Mor; Gur Mosheiov (Int. J. Prod. Res., 2019)

Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion. - Sergey Kovalev; Mikhail Y. Kovalyov; Gur Mosheiov; Enrique Gerstl (Int. J. Prod. Res., 2019)

Comments on "Proportionate flowshops with general position dependent processing times" [Inf. Process. Lett. 111 and "Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection" [Inf. Process. Lett. 132 (2018) 39-43]. - Mikhail Y. Kovalyov; Gur Mosheiov; Dmitrij Sesok (Inf. Process. Lett., 2019)

Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. - Gur Mosheiov; Assaf Sarig; Vitaly A. Strusevich (4OR, 2020)

Scheduling problems with a weight-modifying-activity. - Gur Mosheiov; Daniel Oron (Ann. Oper. Res., 2020)

Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. - Baruch Mor; Gur Mosheiov; Dana Shapira (Inf. Process. Lett., 2020)

Minimizing total load on parallel machines with linear deterioration. - Baruch Mor; Gur Mosheiov (Optim. Lett., 2020)

Editorial: Dynamic Scheduling Problems. - Alessandro Agnetis; Stanislaw Gawiejnowicz; Bertrand Miao-Tsong Lin; Gur Mosheiov (J. Sched., 2020)

Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. - Enrique Gerstl; Gur Mosheiov (J. Sched., 2020)

Flowshop scheduling with learning effect and job rejection. - Baruch Mor; Gur Mosheiov; Dana Shapira (J. Sched., 2020)

A note: flowshop scheduling with linear deterioration and job-rejection. - Baruch Mor; Gur Mosheiov (4OR, 2021)

Minmax due-date assignment on a two-machine flowshop. - Baruch Mor; Gur Mosheiov (Ann. Oper. Res., 2021)

A note on scheduling a rate modifying activity to minimize total late work. - Gur Mosheiov; Daniel Oron (Comput. Ind. Eng., 2021)

Scheduling with competing agents, total late work and job rejection. - David Freud; Gur Mosheiov (Comput. Oper. Res., 2021)

Coupled task scheduling with convex resource consumption functions. - Gur Mosheiov; Daniel Oron; Amir Salehipour (Discret. Appl. Math., 2021)

Minimizing total late work on a single machine with generalized due-dates. - Gur Mosheiov; Daniel Oron; Dvir Shabtay (Eur. J. Oper. Res., 2021)

The single machine CON problem with unavailability period. - Enrique Gerstl; Gur Mosheiov (Int. J. Prod. Res., 2021)

A note on the single machine CON and CONW problems with lot scheduling. - Baruch Mor; Gur Mosheiov (J. Comb. Optim., 2021)

Single machine lot scheduling with optional job-rejection. - Baruch Mor; Gur Mosheiov; Dana Shapira (J. Comb. Optim., 2021)

Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. - Baruch Mor; Gur Mosheiov; Dvir Shabtay (J. Sched., 2021)

Minimizing total completion time with linear deterioration: A new lower bound. - Matan Atsmony; Gur Mosheiov (Comput. Ind. Eng., 2022)

A Greedy heuristic for solving scheduling problems with bounded rejection cost. - Matan Atsmony; Gur Mosheiov (Comput. Oper. Res., 2022)

Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work. - Dvir Shabtay; Gur Mosheiov; Daniel Oron (Eur. J. Oper. Res., 2022)

Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. - Baruch Mor; Gur Mosheiov (Oper. Res., 2022)

On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. - Gur Mosheiov; Daniel Oron; Dvir Shabtay (J. Sched., 2022)

Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection. - Matan Atsmony; Gur Mosheiov (J. Sched., 2023)

Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity. - Matan Atsmony; Baruch Mor; Gur Mosheiov (Comput. Oper. Res., 2023)

A note on lot scheduling on a single machine to minimize maximum weighted tardiness. - Gur Mosheiov; Assaf Sarig (J. Comb. Optim., 2023)

A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence. - Enrique Gerstl; Gur Mosheiov (J. Sched., 2023)

A note on batch scheduling on a two-machine flowshop with machine-dependent processing times. - Gur Mosheiov; Daniel Oron (4OR, 2023)

The LPT heuristic for minimizing total load on a proportionate openshop. - Enrique Gerstl; Gur Mosheiov (Discret. Appl. Math., 2023)

Common due-date assignment problems with fixed-plus-linear earliness and tardiness costs. - Matan Atsmony; Gur Mosheiov (Comput. Ind. Eng., 2024)

Due-Date assignment with acceptable lead-times on parallel machines. - Baruch Mor; Gur Mosheiov (Comput. Oper. Res., 2024)

Scheduling on parallel dedicated machines with job rejection. - Baruch Mor; Gur Mosheiov (Int. J. Prod. Res., 2024)

A common due-date assignment problem with job rejection on parallel uniform machines. - Gur Mosheiov; Assaf Sarig (Int. J. Prod. Res., 2024)

Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection. - Matan Atsmony; Gur Mosheiov (Optim. Lett., 2024)

Single machine scheduling with step-learning. - Matan Atsmony; Baruch Mor; Gur Mosheiov (J. Sched., 2024)

Dynamic scheduling problems in theory and practice. - Stanislaw Gawiejnowicz; Bertrand Miao-Tsong Lin; Gur Mosheiov (J. Sched., 2024)

The minmax due-date assignment problem with acceptable lead-times. - Gur Mosheiov; Assaf Sarig (Ann. Oper. Res., 2024)

Scheduling problems on parallel machines with machine-dependent generalized due-dates. - Baruch Mor; Gur Mosheiov; Dvir Shabtay (Ann. Oper. Res., 2025)

Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times. - Enrique Gerstl; Gur Mosheiov (Optim. Lett., 2025)

A note: approximation algorithms for batch scheduling on shops with job rejection. - Gur Mosheiov; Assaf Sarig (Oper. Res., 2025)