Baruch Mor

According to our database, Baruch Mor authored at least 50 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times.

Dvir Shabtay, Baruch Mor

J. Sched., June, 2024

Single machine scheduling with step-learning.

Matan Atsmony, Baruch Mor, Gur Mosheiov

J. Sched., June, 2024

Scheduling on parallel dedicated machines with job rejection.

Baruch Mor, Gur Mosheiov

Int. J. Prod. Res., 2024

Due-Date assignment with acceptable lead-times on parallel machines.

Baruch Mor, Gur Mosheiov

Comput. Oper. Res., 2024

2023

Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity.

Matan Atsmony, Baruch Mor, Gur Mosheiov

Comput. Oper. Res., April, 2023

Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection.

Baruch Mor

Oper. Res., March, 2023

Lot scheduling involving completion time problems on identical parallel machines.

Nurit Biber, Baruch Mor, Yitzhak Schlissel, Dana Shapira

Oper. Res., March, 2023

2022

Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection.

Baruch Mor, Gur Mosheiov

Oper. Res., 2022

Minsum scheduling with acceptable lead-times and optional job rejection.

Baruch Mor, Dana Shapira

Optim. Lett., 2022

Scheduling problems on a new setting of flexible flowshops: ℓ-Machine proportionate flowshops.

Baruch Mor, Dana Shapira

J. Oper. Res. Soc., 2022

Single machine scheduling with non-availability interval and optional job rejection.

Baruch Mor, Dana Shapira

J. Comb. Optim., 2022

Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads.

Baruch Mor

J. Comb. Optim., 2022

Single-machine scheduling with total late work and job rejection.

Baruch Mor, Dvir Shabtay

Comput. Ind. Eng., 2022

Scheduling data gathering with background communications and a processing stage.

Joanna Berlinska, Baruch Mor

Comput. Ind. Eng., 2022

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

Single machine lot scheduling with optional job-rejection.

Baruch Mor, Gur Mosheiov, Dana Shapira

J. Comb. Optim., 2021

A note on the single machine CON and CONW problems with lot scheduling.

Baruch Mor, Gur Mosheiov

J. Comb. Optim., 2021

Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times.

Baruch Mor, Dvir Shabtay, Liron Yedidsion

Comput. Ind. Eng., 2021

Minmax due-date assignment on a two-machine flowshop.

Baruch Mor, Gur Mosheiov

Ann. Oper. Res., 2021

A note: flowshop scheduling with linear deterioration and job-rejection.

Baruch Mor, Gur Mosheiov

4OR, 2021

2020

Flowshop scheduling with learning effect and job rejection.

Baruch Mor, Gur Mosheiov, Dana Shapira

J. Sched., 2020

Minimizing total load on parallel machines with linear deterioration.

Baruch Mor, Gur Mosheiov

Optim. Lett., 2020

Scheduling with regular performance measures and optional job rejection on a single machine.

Baruch Mor, Dana Shapira

J. Oper. Res. Soc., 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

Regular scheduling measures on proportionate flowshop with job rejection.

Baruch Mor, Dana Shapira

Comput. Appl. Math., 2020

2019

Improved algorithms for scheduling on proportionate flowshop with job-rejection.

Baruch Mor, Dana Shapira

J. Oper. Res. Soc., 2019

Minmax scheduling problems with common due-date and completion time penalty.

Baruch Mor

J. Comb. Optim., 2019

Scheduling on a proportionate flowshop to minimise total late work.

Enrique Gerstl, Baruch Mor, Gur Mosheiov

Int. J. Prod. Res., 2019

2018

Minmax common due-window assignment and scheduling on a single machine with two competing agents.

Baruch Mor

J. Oper. Res. Soc., 2018

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

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

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

Scheduling with two competing agents to minimize total weighted earliness.

Enrique Gerstl, Baruch Mor, Gur Mosheiov

Ann. Oper. Res., 2017

2016

Minimizing maximum cost on a single machine with two competing agents and job rejection.

Baruch Mor, Gur Mosheiov

J. Oper. Res. Soc., 2016

Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance.

Baruch Mor, Gur Mosheiov

Eur. J. Oper. Res., 2016

2015

Minimizing the number of early jobs on a proportionate flowshop.

Baruch Mor, Gur Mosheiov

J. Oper. Res. Soc., 2015

A note: Minimizing maximum earliness on a proportionate flowshop.

Baruch Mor, Gur Mosheiov

Inf. Process. Lett., 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

Scheduling a deteriorating maintenance activity and due-window assignment.

Baruch Mor, Gur Mosheiov

Comput. Oper. Res., 2015

2014

Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents.

Baruch Mor, Gur Mosheiov

J. Oper. Res. Soc., 2014

Batch scheduling of identical jobs with controllable processing times.

Baruch Mor, Gur Mosheiov

Comput. Oper. Res., 2014

2013

A note: Minmax due-date assignment problem with lead-time cost.

Baruch Mor, Gur Mosheiov, Dvir Shabtay

Comput. Oper. Res., 2013

2012

The equal allocation policy in open shop batch scheduling.

Baruch Mor, Gur Mosheiov, Daniel Oron

J. Oper. Res. Soc., 2012

Minmax scheduling problems with common flow-allowance.

Baruch Mor, Gur Mosheiov

J. Oper. Res. Soc., 2012

Batch scheduling of identical jobs on parallel identical machines.

Baruch Mor, Gur Mosheiov

Inf. Process. Lett., 2012

Batch scheduling on uniform machines to minimize total flow-time.

Baruch Mor, Gur Mosheiov

Comput. Oper. Res., 2012

Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times.

Baruch Mor, Gur Mosheiov

Comput. Ind. Eng., 2012

2011

Single machine batch scheduling with two competing agents to minimize total flowtime.

Baruch Mor, Gur Mosheiov

Eur. J. Oper. Res., 2011

Total absolute deviation of job completion times on uniform and unrelated machines.

Baruch Mor, Gur Mosheiov

Comput. Oper. Res., 2011

2010

Scheduling problems with two competing agents to minimize minmax and minsum earliness measures.

Baruch Mor, Gur Mosheiov

Eur. J. Oper. Res., 2010