| Issue Date | Title | Author(s) |
| 2010-12-01 | Discrete optimization with polynomially detectable boundaries and restricted level sets | Zinder, Y; Memar, J; Singh, G |
| 2013-01-01 | Discrete optimization with polynomially detectable boundaries and restricted level sets | Zinder, Y; Memar, J; Singh, G |
| 2018-09-01 | Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements | Gu, H; Kononov, A; Memar, J; Zinder, Y |
| 2018-01-01 | Efficient lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements | Gu, H; Memar, J; Zinder, Y |
| 2019-01-01 | Flow shop with job–dependent buffer requirements—a polynomial–time algorithm and efficient heuristics | Kononov, A; Memar, J; Zinder, Y |
| 2019-09-01 | Improved Lagrangian relaxation based optimization procedure for scheduling with storage | Gu, H; Memar, J; Zinder, Y |
| 2015-01-01 | Mastery learning to address the assumed mathematics knowledge gap, encourage learning and reflection, and future-proof academic performance | Groen, L; Coupland, M; Memar, J; Langtry, T |
| 2015-04-30 | The Mathematics Problem and Mastery Learning for First-Year, Undergraduate STEM Students | Groen, L; Coupland, M; Langtry, T; Memar, J; Moore, BJ; Stanley, J |
| 2022-01-01 | On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements | Kononov, A; Memar, J; Zinder, Y |
| 2018-01-01 | Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach | Gu, H; Memar, J; Zinder, Y |
| 2013-01-01 | Scheduling partially ordered UET tasks on dedicated machines | Memar, J; Singh, G; Zinder, Y |
| 2018-01-01 | Search Strategies for Problems with Detectable Boundaries and Restricted Level Sets | Gu, H; Memar, J; Zinder, Y; Sarker, R; Abbass, HA; Dunstall, S; Kilby, P; Davis, R; Young, L |
