Yakov Zinder
Orcid: 0000-0003-2024-8129Affiliations:
- University of Technology Sydney, Australia
According to our database1,
Yakov Zinder
authored at least 42 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Comput. Oper. Res., 2024
2023
Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem.
J. Heuristics, February, 2023
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
A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty.
EURO J. Comput. Optim., 2022
An efficient optimisation procedure for the Workforce Scheduling and Routing Problem: Lagrangian relaxation and iterated local search.
Comput. Oper. Res., 2022
2021
A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements.
J. Comb. Optim., 2021
Iterated Local Search with Neighbourhood Reduction for the Pickups and Deliveries Problem Arising in Retail Industry.
Proceedings of the Optimization and Learning - 4th International Conference, 2021
Maximising the Total Weight of On-Time Jobs on Parallel Machines Subject to a Conflict Graph.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021
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
2020
Autom. Remote. Control., 2020
2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 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
Proceedings of the 11th International Conference on Knowledge and Systems Engineering, 2019
2018
Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem.
Theor. Comput. Sci., 2018
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements.
J. Discrete Algorithms, 2018
Autom. Remote. Control., 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
Ann. Oper. Res., 2017
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017
2016
Oper. Res. Lett., 2016
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom.
Comput. Oper. Res., 2016
A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
2015
Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness.
Discret. Appl. Math., 2015
2013
Discrete optimization with polynomially detectable boundaries and restricted level sets.
J. Comb. Optim., 2013
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
2009
2006
A New Method of Scheduling UET Tasks on Parallel Machines.
Proceedings of the International MultiConference of Engineers and Computer Scientists 2006, 2006
2005
Discret. Optim., 2005
Asia Pac. J. Oper. Res., 2005
2004
Eur. J. Oper. Res., 2004
2003
Eur. J. Oper. Res., 2003
Dynamic Programming Approach to Image Segmentation and its Application to Pre-processing of Mammograms.
Aust. J. Intell. Inf. Process. Syst., 2003
2000
Math. Methods Oper. Res., 2000
1998
An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness.
Ann. Oper. Res., 1998