Yakov Zinder

Orcid: 0000-0003-2024-8129

Affiliations:
  • University of Technology Sydney, Australia


According to our database1, Yakov Zinder authored at least 41 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Minimum-weight partitioning of a set with associated subsets.
CoRR, 2022

An efficient optimisation procedure for the Workforce Scheduling and Routing Problem: Lagrangian relaxation and iterated local search.
Comput. Oper. Res., 2022

2021
Two-machine flow shop with dynamic storage space.
Optim. Lett., 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

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

2020
Rescheduling Traffic on a Partially Blocked Segment of Railway with a Siding.
Autom. Remote. Control., 2020

2019
Flexible flow shop with dedicated buffers.
Discret. Appl. Math., 2019

Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations.
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

On The Capacitated Scheduling Problem with Conflict Jobs.
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

Planning personnel retraining: column generation heuristics.
J. Comb. Optim., 2018

Scheduling the Two-Way Traffic on a Single-Track Railway with a Siding.
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
A multi-stage IP-based heuristic for class timetabling and trainer rostering.
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
Permutation schedules for a two-machine flow shop with storage.
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

Scheduling Personnel Retraining: Column Generation Heuristics.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Capacity planning in supply chains of mineral resources.
Inf. Sci., 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

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

The Solvable Cases of a Scheduling Algorithm.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2009
The worst-case analysis of the Garey-Johnson algorithm.
J. Sched., 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
Computational complexity of some scheduling problems with multiprocessor tasks.
Discret. Optim., 2005

Preemptive Scheduling on Parallel Processors with due dates.
Asia Pac. J. Oper. Res., 2005

2004
Hybrid flow-shop scheduling problems with multiprocessor task systems.
Eur. J. Oper. Res., 2004

2003
An iterative algorithm for scheduling UET tasks with due dates and release times.
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
Scheduling UET task systems with concurrency on two parallel identical processors.
Math. Methods Oper. Res., 2000

1998
An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness.
Ann. Oper. Res., 1998


  Loading...