Mor Baruch

Baruch Mor

Information about the author Baruch Mor will soon be added to the site.
Found 8 papers in total
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...
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...
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...
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...
Papers per page: