Gur Mosheiov
Orcid: 0000-0002-2824-8214
According to our database1,
Gur Mosheiov
authored at least 129 papers
between 1991 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
5
10
8
6
5
10
7
3
3
6
3
5
3
7
8
4
6
7
7
1
3
5
4
4
1
5
1
1
1
1
3
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Ann. Oper. Res., December, 2024
Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection.
Optim. Lett., April, 2024
A common due-date assignment problem with job rejection on parallel uniform machines.
Int. J. Prod. Res., March, 2024
Int. J. Prod. Res., 2024
Comput. Oper. Res., 2024
Common due-date assignment problems with fixed-plus-linear earliness and tardiness costs.
Comput. Ind. Eng., 2024
2023
Discret. Appl. Math., October, 2023
A note on batch scheduling on a two-machine flowshop with machine-dependent processing times.
4OR, September, 2023
A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence.
J. Sched., August, 2023
J. Comb. Optim., July, 2023
Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity.
Comput. Oper. Res., April, 2023
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection.
J. Sched., 2023
2022
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates.
J. Sched., 2022
Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection.
Oper. Res., 2022
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work.
Eur. J. Oper. Res., 2022
Comput. Oper. Res., 2022
Comput. Ind. Eng., 2022
2021
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates.
J. Sched., 2021
J. Comb. Optim., 2021
Eur. J. Oper. Res., 2021
Discret. Appl. Math., 2021
Comput. Oper. Res., 2021
Comput. Ind. Eng., 2021
2020
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates.
J. Sched., 2020
Optim. Lett., 2020
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders.
Inf. Process. Lett., 2020
Minmax scheduling and due-window assignment with position-dependent processing times and job rejection.
4OR, 2020
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].
Inf. Process. Lett., 2019
Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion.
Int. J. Prod. Res., 2019
Int. J. Prod. Res., 2019
2018
Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection.
Inf. Process. Lett., 2018
Two-machine flow shop and open shop scheduling problems with a single maintenance window.
Eur. J. Oper. Res., 2018
A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection.
Ann. Oper. Res., 2018
2017
Scheduling with job-rejection and position-dependent processing times on proportionate flowshops.
Optim. Lett., 2017
A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance.
J. Comb. Optim., 2017
Int. J. Prod. Res., 2017
Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection.
Comput. Oper. Res., 2017
Minmax weighted earliness-tardiness with identical processing times and two competing agents.
Comput. Ind. Eng., 2017
Ann. Oper. Res., 2017
2016
Minimizing maximum cost on a single machine with two competing agents and job rejection.
J. Oper. Res. Soc., 2016
Eur. J. Oper. Res., 2016
Comput. Oper. Res., 2016
2015
J. Oper. Res. Soc., 2015
Inf. Process. Lett., 2015
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop.
Inf. Process. Lett., 2015
Comput. Oper. Res., 2015
2014
The optimal number of used machines in a two-stage flexible flowshop scheduling problem.
J. Sched., 2014
Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents.
J. Oper. Res. Soc., 2014
Comput. Oper. Res., 2014
2013
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times.
J. Sched., 2013
An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs.
Inf. Process. Lett., 2013
Eur. J. Oper. Res., 2013
Comput. Oper. Res., 2013
Scheduling problems with two competing agents to minimized weighted earliness-tardiness.
Comput. Oper. Res., 2013
Ann. Oper. Res., 2013
2012
Inf. Process. Lett., 2012
Scheduling on parallel identical machines with job-rejection and position-dependent processing times.
Inf. Process. Lett., 2012
Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times.
Comput. Oper. Res., 2012
Comput. Oper. Res., 2012
Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times.
Comput. Ind. Eng., 2012
2011
J. Oper. Res. Soc., 2011
Inf. Process. Lett., 2011
Single machine batch scheduling with two competing agents to minimize total flowtime.
Eur. J. Oper. Res., 2011
Comput. Oper. Res., 2011
2010
J. Oper. Res. Soc., 2010
Eur. J. Oper. Res., 2010
Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine.
Eur. J. Oper. Res., 2010
Scheduling problems with two competing agents to minimize minmax and minsum earliness measures.
Eur. J. Oper. Res., 2010
Comput. Oper. Res., 2010
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].
Eur. J. Oper. Res., 2009
A note: Simple heuristics for scheduling a maintenance activity on unrelated machines.
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
Comput. Math. Appl., 2009
Adv. Oper. Res., 2009
2008
Math. Comput. Model., 2008
J. Oper. Res. Soc., 2008
Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines.
J. Oper. Res. Soc., 2008
Eur. J. Oper. Res., 2008
A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time.
Eur. J. Oper. Res., 2008
An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs.
Comput. Oper. Res., 2008
2007
Eur. J. Oper. Res., 2007
2006
Math. Comput. Model., 2006
Inf. Process. Lett., 2006
Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs.
Eur. J. Oper. Res., 2006
2005
Oper. Res. Lett., 2005
Note on scheduling with general learning curves to minimize the number of tardy jobs.
J. Oper. Res. Soc., 2005
A note on flow-shop and job-shop batch scheduling with identical processing-time jobs.
Eur. J. Oper. Res., 2005
Minimizing total completion time and total deviation of job completion times from a restrictive due-date.
Eur. J. Oper. Res., 2005
2004
Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job".
Eur. J. Oper. Res., 2004
Simultaneous minimization of total completion time and total deviation of job completion times.
Eur. J. Oper. Res., 2004
A note on the SPT heuristic for solving scheduling problems with generalized due dates.
Comput. Oper. Res., 2004
2003
J. Oper. Res. Soc., 2003
J. Oper. Res. Soc., 2003
Comput. Oper. Res., 2003
2002
Discret. Appl. Math., 2002
2001
Eur. J. Oper. Res., 2001
Comput. Oper. Res., 2001
Comput. Oper. Res., 2001
1998
Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps.
Oper. Res. Lett., 1998
1997
Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs.
Oper. Res., 1997
1996
Comput. Oper. Res., 1996
1995
1994
Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs.
Oper. Res. Lett., 1994
1991