Julia Memar

Orcid: 0000-0003-2395-1450

According to our database1, Julia Memar authored at least 8 papers between 2013 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements.
J. Glob. Optim., 2022

2021
Algorithms for Flow Shop with Job-Dependent Buffer Requirements.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2021

2019
Flow Shop with Job-Dependent Buffer Requirements - a Polynomial-Time Algorithm and Efficient Heuristics.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

2018
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements.
J. Discrete Algorithms, 2018

Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

2017
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2013
Discrete optimization with polynomially detectable boundaries and restricted level sets.
J. Comb. Optim., 2013

Scheduling Partially Ordered UET Tasks on Dedicated Machines.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013


  Loading...