Baruch Mor

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 39

Top Topics

Top Venues

J. Oper. Res. Soc.

J. Comb. Optim.

Comput. Oper. Res.

Publications

Matan Atsmony, Baruch Mor, Gur Mosheiov
Single machine scheduling with step-learning. J. Sched. 27 (3) (2024)
Baruch Mor, Gur Mosheiov
Due-Date assignment with acceptable lead-times on parallel machines. Comput. Oper. Res. 166 (2024)
Dvir Shabtay, Baruch Mor
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. J. Sched. 27 (3) (2024)
Baruch Mor
Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection. Oper. Res. 23 (1) (2023)
Matan Atsmony, Baruch Mor, Gur Mosheiov
Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity. Comput. Oper. Res. 152 (2023)
Nurit Biber, Baruch Mor, Yitzhak Schlissel, Dana Shapira
Lot scheduling involving completion time problems on identical parallel machines. Oper. Res. 23 (1) (2023)
Baruch Mor, Dvir Shabtay
Single-machine scheduling with total late work and job rejection. Comput. Ind. Eng. 169 (2022)
Baruch Mor, Dana Shapira
Minsum scheduling with acceptable lead-times and optional job rejection. Optim. Lett. 16 (3) (2022)
Baruch Mor, Dana Shapira
Single machine scheduling with non-availability interval and optional job rejection. J. Comb. Optim. 44 (1) (2022)
Baruch Mor
Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads. J. Comb. Optim. 43 (1) (2022)
Baruch Mor, Dana Shapira
Scheduling problems on a new setting of flexible flowshops: ℓ-Machine proportionate flowshops. J. Oper. Res. Soc. 73 (7) (2022)
Joanna Berlinska, Baruch Mor
Scheduling data gathering with background communications and a processing stage. Comput. Ind. Eng. 171 (2022)
Baruch Mor, Gur Mosheiov
Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. Oper. Res. 22 (3) (2022)
Baruch Mor, Gur Mosheiov, Dvir Shabtay
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. J. Sched. 24 (6) (2021)
Baruch Mor, Gur Mosheiov, Dana Shapira
Single machine lot scheduling with optional job-rejection. J. Comb. Optim. 41 (1) (2021)
Baruch Mor, Gur Mosheiov
Minmax due-date assignment on a two-machine flowshop. Ann. Oper. Res. 305 (1) (2021)
Baruch Mor, Gur Mosheiov
A note: flowshop scheduling with linear deterioration and job-rejection. 4OR 19 (1) (2021)
Baruch Mor, Dvir Shabtay, Liron Yedidsion
Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times. Comput. Ind. Eng. 153 (2021)
Baruch Mor, Gur Mosheiov
A note on the single machine CON and CONW problems with lot scheduling. J. Comb. Optim. 42 (2) (2021)
Baruch Mor, Gur Mosheiov, Dana Shapira
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. Inf. Process. Lett. 164 (2020)
Baruch Mor, Gur Mosheiov, Dana Shapira
Flowshop scheduling with learning effect and job rejection. J. Sched. 23 (6) (2020)
Baruch Mor, Gur Mosheiov
Minimizing total load on parallel machines with linear deterioration. Optim. Lett. 14 (3) (2020)
Baruch Mor, Dana Shapira
Regular scheduling measures on proportionate flowshop with job rejection. Comput. Appl. Math. 39 (2) (2020)
Baruch Mor, Dana Shapira
Scheduling with regular performance measures and optional job rejection on a single machine. J. Oper. Res. Soc. 71 (8) (2020)
Baruch Mor, Dana Shapira
Improved algorithms for scheduling on proportionate flowshop with job-rejection. J. Oper. Res. Soc. 70 (11) (2019)
Enrique Gerstl, Baruch Mor, Gur Mosheiov
Scheduling on a proportionate flowshop to minimise total late work. Int. J. Prod. Res. 57 (2) (2019)
Baruch Mor
Minmax scheduling problems with common due-date and completion time penalty. J. Comb. Optim. 38 (1) (2019)
Baruch Mor
Minmax common due-window assignment and scheduling on a single machine with two competing agents. J. Oper. Res. Soc. 69 (4) (2018)
Baruch Mor, Gur Mosheiov
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. 271 (2) (2018)
Enrique Gerstl, Baruch Mor, Gur Mosheiov
Scheduling with two competing agents to minimize total weighted earliness. Ann. Oper. Res. 253 (1) (2017)
Enrique Gerstl, Baruch Mor, Gur Mosheiov
Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection. Comput. Oper. Res. 83 (2017)
Baruch Mor, Dana Shapira
Scheduling with regular performance measures and optional job rejection on a single machine. CoRR (2017)
Baruch Mor, Gur Mosheiov
A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. J. Comb. Optim. 33 (4) (2017)
Baruch Mor, Gur Mosheiov
Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. Eur. J. Oper. Res. 254 (2) (2016)
Baruch Mor, Gur Mosheiov
Minimizing maximum cost on a single machine with two competing agents and job rejection. J. Oper. Res. Soc. 67 (12) (2016)
Enrique Gerstl, Baruch Mor, Gur Mosheiov
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Inf. Process. Lett. 115 (2) (2015)
Baruch Mor, Gur Mosheiov
A note: Minimizing maximum earliness on a proportionate flowshop. Inf. Process. Lett. 115 (2) (2015)
Baruch Mor, Gur Mosheiov
Scheduling a deteriorating maintenance activity and due-window assignment. Comput. Oper. Res. 57 (2015)
Baruch Mor, Gur Mosheiov
Minimizing the number of early jobs on a proportionate flowshop. J. Oper. Res. Soc. 66 (9) (2015)
Baruch Mor, Gur Mosheiov
Batch scheduling of identical jobs with controllable processing times. Comput. Oper. Res. 41 (2014)
Baruch Mor, Gur Mosheiov
Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. J. Oper. Res. Soc. 65 (1) (2014)
Baruch Mor, Gur Mosheiov, Dvir Shabtay
A note: Minmax due-date assignment problem with lead-time cost. Comput. Oper. Res. 40 (8) (2013)
Baruch Mor, Gur Mosheiov
Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times. Comput. Ind. Eng. 62 (4) (2012)
Baruch Mor, Gur Mosheiov
Batch scheduling of identical jobs on parallel identical machines. Inf. Process. Lett. 112 (20) (2012)
Baruch Mor, Gur Mosheiov, Daniel Oron
The equal allocation policy in open shop batch scheduling. J. Oper. Res. Soc. 63 (5) (2012)
Baruch Mor, Gur Mosheiov
Batch scheduling on uniform machines to minimize total flow-time. Comput. Oper. Res. 39 (3) (2012)
Baruch Mor, Gur Mosheiov
Minmax scheduling problems with common flow-allowance. J. Oper. Res. Soc. 63 (9) (2012)
Baruch Mor, Gur Mosheiov
Total absolute deviation of job completion times on uniform and unrelated machines. Comput. Oper. Res. 38 (3) (2011)
Baruch Mor, Gur Mosheiov
Single machine batch scheduling with two competing agents to minimize total flowtime. Eur. J. Oper. Res. 215 (3) (2011)
Baruch Mor, Gur Mosheiov
Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. Eur. J. Oper. Res. 206 (3) (2010)