Mosheiov Gur

Gur Mosheiov

Information about the author Gur Mosheiov will soon be added to the site.
Found 50 papers in total
Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
2017
In this article, we consider a single machine scheduling problem, in which identical...
Scheduling with two competing agents to minimize total weighted earliness
Scheduling with two competing agents to minimize total weighted earliness
2017
We study a single machine scheduling problem with two competing agents and earliness...
Minimizing maximum cost on a single machine with two competing agents and job rejection
Minimizing maximum cost on a single machine with two competing agents and job rejection
2016
The classical Lawler’s Algorithm provides an optimal solution to the...
Minimizing the number of early jobs on a proportionate flowshop
Minimizing the number of early jobs on a proportionate flowshop
2015
A proportionate flowshop is a special case of the classical flowshop, where the job...
Scheduling with a due-window for acceptable lead-times
Scheduling with a due-window for acceptable lead-times
2015
Due‐dates are often determined during sales negotiations in two stages: (i) in...
Single machine just-in-time scheduling problems with two competing agents
Single machine just-in-time scheduling problems with two competing agents
2014
In scheduling problems with two competing agents, each one of the agents has his own...
Batch scheduling of identical jobs with controllable processing times
Batch scheduling of identical jobs with controllable processing times
2014
In scheduling models with controllable processing times , the job processing times can...
Minmax due‐date assignment with a time window for acceptable lead‐times
Minmax due‐date assignment with a time window for acceptable lead‐times
2013
In a standard DIF due‐date assignment model, customers may consider late...
The Browne–Yechiali single‐machine sequence is optimal for flow‐shops
The Browne–Yechiali single‐machine sequence is optimal for flow‐shops
2010
An optimal polynomial time solution for minimum makespan on a single machine with...
Scheduling problems with two competing agents to minimized weighted earliness–tardiness
Scheduling problems with two competing agents to minimized weighted earliness–tardiness
2013
We study scheduling problems with two competing agents , sharing the same machines....
Batch scheduling on uniform machines to minimize total flow‐time
Batch scheduling on uniform machines to minimize total flow‐time
2012
The solution of the classical batch scheduling problem with identical jobs and setup...
Heuristics for scheduling problems with an unavailability constraint and position‐dependent processing times
Heuristics for scheduling problems with an unavailability constraint and position‐dependent processing times
2012
We study a single machine scheduling problem, where the machine is unavailable for...
Scheduling a maintenance activity and due‐window assignment based on common flow allowance
Scheduling a maintenance activity and due‐window assignment based on common flow allowance
2012
We study a due‐window assignment problem on a single machine. The...
A note: Multi‐machine scheduling with general position‐based deterioration to minimize total load
A note: Multi‐machine scheduling with general position‐based deterioration to minimize total load
2012
The majority of the papers dealing with scheduling deteriorating jobs ignores general...
Scheduling job classes on uniform machines
Scheduling job classes on uniform machines
2012
We study a scheduling problem with job classes on parallel uniform machines. All the...
Minimizing the number of tardy jobs on a proportionate flowshop with general position‐dependent processing times
Minimizing the number of tardy jobs on a proportionate flowshop with general position‐dependent processing times
2012
In various real life scheduling systems job processing times vary according to the...
Batch scheduling on a two-machine jobshop with machine-dependent setup times
Batch scheduling on a two-machine jobshop with machine-dependent setup times
2011
The problem of minimum makespan on an m machine jobshop with unit execution time (UET)...
Single machine batch scheduling with two competing agents to minimize total flowtime
Single machine batch scheduling with two competing agents to minimize total flowtime
2011
We study a single machine scheduling problem, where two agents compete on the use of a...
Batch scheduling on two-machine flowshop with machine-dependent setup times
Batch scheduling on two-machine flowshop with machine-dependent setup times
2009
We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing...
Minmax scheduling with job-classes and earliness–tardiness costs
Minmax scheduling with job-classes and earliness–tardiness costs
2007
We address scheduling problems with job-dependent due-dates and general (possibly...
Minimizing weighted earliness–tardiness and due-date cost with unit processing-time jobs
Minimizing weighted earliness–tardiness and due-date cost with unit processing-time jobs
2006
The classical single-machine scheduling and due-date assignment problem of Panwalker...
Due-date assignment and maintenance activity scheduling problem
Due-date assignment and maintenance activity scheduling problem
2006
In the scheduling problem addressed in this note we have to determine: (i) the job...
Minimizing total completion time and total deviation of job completion times from a restrictive due-date
Minimizing total completion time and total deviation of job completion times from a restrictive due-date
2005
We study a single-machine scheduling problem with the objective of minimizing a linear...
Minimizing flow-time on a single machine with integer batch sizes
Minimizing flow-time on a single machine with integer batch sizes
2005
We address a classical minimum flow-time, single-machine, batch-scheduling problem....
Papers per page: