default search action
Baruch Mor
Person information
- affiliation: Ariel University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j50]Baruch Mor
, Gur Mosheiov:
Due-Date assignment with acceptable lead-times on parallel machines. Comput. Oper. Res. 166: 106617 (2024) - [j49]Baruch Mor
Scheduling on parallel dedicated machines with job rejection. Int. J. Prod. Res. 62(19): 6933-6940 (2024) - [j48]Matan Atsmony, Baruch Mor
Single machine scheduling with step-learning. J. Sched. 27(3): 227-237 (2024) - [j47]Dvir Shabtay
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times. J. Sched. 27(3): 239-256 (2024) - 2023
- [j46]Matan Atsmony, Baruch Mor
Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity. Comput. Oper. Res. 152: 106133 (2023) - [j45]Baruch Mor
Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection. Oper. Res. 23(1): 10 (2023) - [j44]Nurit Biber, Baruch Mor
Lot scheduling involving completion time problems on identical parallel machines. Oper. Res. 23(1): 12 (2023) - 2022
- [j43]Baruch Mor, Dvir Shabtay:
Single-machine scheduling with total late work and job rejection. Comput. Ind. Eng. 169: 108168 (2022) - [j42]Joanna Berlinska
Scheduling data gathering with background communications and a processing stage. Comput. Ind. Eng. 171: 108467 (2022) - [j41]Baruch Mor
Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads. J. Comb. Optim. 43(1): 79-97 (2022) - [j40]Baruch Mor
Single machine scheduling with non-availability interval and optional job rejection. J. Comb. Optim. 44(1): 480-497 (2022) - [j39]Baruch Mor
Scheduling problems on a new setting of flexible flowshops: ℓ-Machine proportionate flowshops. J. Oper. Res. Soc. 73(7): 1499-1516 (2022) - [j38]Baruch Mor
Minsum scheduling with acceptable lead-times and optional job rejection. Optim. Lett. 16(3): 1073-1091 (2022) - [j37]Baruch Mor
Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. Oper. Res. 22(3): 2707-2719 (2022) - 2021
- [j36]Baruch Mor
A note: flowshop scheduling with linear deterioration and job-rejection. 4OR 19(1): 103-111 (2021) - [j35]Baruch Mor
Minmax due-date assignment on a two-machine flowshop. Ann. Oper. Res. 305(1): 191-209 (2021) - [j34]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: 107024 (2021) - [j33]Baruch Mor
Single machine lot scheduling with optional job-rejection. J. Comb. Optim. 41(1): 1-11 (2021) - [j32]Baruch Mor
A note on the single machine CON and CONW problems with lot scheduling. J. Comb. Optim. 42(2): 327-338 (2021) - [j31]Baruch Mor
Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. J. Sched. 24(6): 553-567 (2021) - 2020
- [j30]Baruch Mor
Regular scheduling measures on proportionate flowshop with job rejection. Comput. Appl. Math. 39(2) (2020) - [j29]Baruch Mor, Gur Mosheiov, Dana Shapira
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. Inf. Process. Lett. 164: 106009 (2020) - [j28]Baruch Mor
Scheduling with regular performance measures and optional job rejection on a single machine. J. Oper. Res. Soc. 71(8): 1315-1325 (2020) - [j27]Baruch Mor
Minimizing total load on parallel machines with linear deterioration. Optim. Lett. 14(3): 771-779 (2020) - [j26]Baruch Mor
Flowshop scheduling with learning effect and job rejection. J. Sched. 23(6): 631-641 (2020)
2010 – 2019
- 2019
- [j25]Enrique Gerstl
Scheduling on a proportionate flowshop to minimise total late work. Int. J. Prod. Res. 57(2): 531-543 (2019) - [j24]Baruch Mor
Minmax scheduling problems with common due-date and completion time penalty. J. Comb. Optim. 38(1): 50-71 (2019) - [j23]Baruch Mor
Improved algorithms for scheduling on proportionate flowshop with job-rejection. J. Oper. Res. Soc. 70(11): 1997-2003 (2019) - 2018
- [j22]Baruch Mor
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): 1079-1085 (2018) - [j21]Baruch Mor
Minmax common due-window assignment and scheduling on a single machine with two competing agents. J. Oper. Res. Soc. 69(4): 589-602 (2018) - 2017
- [j20]Enrique Gerstl
Scheduling with two competing agents to minimize total weighted earliness. Ann. Oper. Res. 253(1): 227-245 (2017) - [j19]Enrique Gerstl
Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection. Comput. Oper. Res. 83: 150-156 (2017) - [j18]Baruch Mor
A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. J. Comb. Optim. 33(4): 1454-1468 (2017) - [i1]Baruch Mor, Dana Shapira:
Scheduling with regular performance measures and optional job rejection on a single machine. CoRR abs/1711.03720 (2017) - 2016
- [j17]Baruch Mor
Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. Eur. J. Oper. Res. 254(2): 360-370 (2016) - [j16]Baruch Mor
Minimizing maximum cost on a single machine with two competing agents and job rejection. J. Oper. Res. Soc. 67(12): 1524-1531 (2016) - 2015
- [j15]Baruch Mor
Scheduling a deteriorating maintenance activity and due-window assignment. Comput. Oper. Res. 57: 33-40 (2015) - [j14]Enrique Gerstl
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Inf. Process. Lett. 115(2): 159-162 (2015) - [j13]Baruch Mor
A note: Minimizing maximum earliness on a proportionate flowshop. Inf. Process. Lett. 115(2): 253-255 (2015) - [j12]Baruch Mor
Minimizing the number of early jobs on a proportionate flowshop. J. Oper. Res. Soc. 66(9): 1426-1429 (2015) - 2014
- [j11]Baruch Mor
Batch scheduling of identical jobs with controllable processing times. Comput. Oper. Res. 41: 115-124 (2014) - [j10]Baruch Mor
Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. J. Oper. Res. Soc. 65(1): 151-157 (2014) - 2013
- [j9]Baruch Mor
A note: Minmax due-date assignment problem with lead-time cost. Comput. Oper. Res. 40(8): 2161-2164 (2013) - 2012
- [j8]Baruch Mor
Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times. Comput. Ind. Eng. 62(4): 908-916 (2012) - [j7]Baruch Mor
Batch scheduling on uniform machines to minimize total flow-time. Comput. Oper. Res. 39(3): 571-575 (2012) - [j6]Baruch Mor
Batch scheduling of identical jobs on parallel identical machines. Inf. Process. Lett. 112(20): 762-766 (2012) - [j5]Baruch Mor
The equal allocation policy in open shop batch scheduling. J. Oper. Res. Soc. 63(5): 646-652 (2012) - [j4]Baruch Mor
Minmax scheduling problems with common flow-allowance. J. Oper. Res. Soc. 63(9): 1284-1293 (2012) - 2011
- [j3]Baruch Mor
Total absolute deviation of job completion times on uniform and unrelated machines. Comput. Oper. Res. 38(3): 660-665 (2011) - [j2]Baruch Mor
Single machine batch scheduling with two competing agents to minimize total flowtime. Eur. J. Oper. Res. 215(3): 524-531 (2011) - 2010
- [j1]Baruch Mor
Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. Eur. J. Oper. Res. 206(3): 540-546 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: