default search action
Yakov Zinder
Person information
- affiliation: University of Technology Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Yakov Zinder, Joanna Berlinska
, Bertrand M. T. Lin
Scheduling jobs with shared additional operations on parallel identical machines. Comput. Oper. Res. 170: 106780 (2024) - 2023
- [j26]Hanyu Gu
Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem. J. Heuristics 29(1): 139-175 (2023) - 2022
- [j25]Hanyu Gu
An efficient optimisation procedure for the Workforce Scheduling and Routing Problem: Lagrangian relaxation and iterated local search. Comput. Oper. Res. 144: 105829 (2022) - [j24]Hanyu Gu
A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty. EURO J. Comput. Optim. 10: 100050 (2022) - [j23]Alexander V. Kononov
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements. J. Glob. Optim. 83(3): 445-456 (2022) - [i2]Yakov Zinder, Bertrand M. T. Lin, Joanna Berlinska:
Minimum-weight partitioning of a set with associated subsets. CoRR abs/2212.05823 (2022) - 2021
- [j22]Yakov Zinder
A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements. J. Comb. Optim. 42(2): 276-309 (2021) - [j21]Joanna Berlinska
Two-machine flow shop with dynamic storage space. Optim. Lett. 15(7): 2433-2454 (2021) - [c15]Alexander V. Kononov
Algorithms for Flow Shop with Job-Dependent Buffer Requirements. MCO 2021: 63-74 - [c14]Yakov Zinder
Maximising the Total Weight of On-Time Jobs on Parallel Machines Subject to a Conflict Graph. MOTOR 2021: 280-295 - [c13]Hanyu Gu
Iterated Local Search with Neighbourhood Reduction for the Pickups and Deliveries Problem Arising in Retail Industry. OLA 2021: 190-202 - [i1]Yakov Zinder, Joanna Berlinska, Charlie Peter:
Maximising the total weight of on-time jobs on parallel machines subject to a conflict graph. CoRR abs/2103.03346 (2021) - 2020
- [j20]Yakov Zinder, Alexander A. Lazarev, Elena G. Musatova
Rescheduling Traffic on a Partially Blocked Segment of Railway with a Siding. Autom. Remote. Control. 81(6): 955-966 (2020)
2010 – 2019
- 2019
- [j19]Andreas T. Ernst, Joey Fung
Flexible flow shop with dedicated buffers. Discret. Appl. Math. 261: 148-163 (2019) - [c12]Minh Hoàng Hà
On The Capacitated Scheduling Problem with Conflict Jobs. KSE 2019: 1-5 - [c11]Alexander V. Kononov
Flow Shop with Job-Dependent Buffer Requirements - a Polynomial-Time Algorithm and Efficient Heuristics. MOTOR 2019: 342-357 - [c10]Hanyu Gu
Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem. SEA² 2019: 527-540 - [c9]Joanna Berlinska
Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations. WCGO 2019: 1139-1148 - 2018
- [j18]Yakov Zinder
Scheduling the Two-Way Traffic on a Single-Track Railway with a Siding. Autom. Remote. Control. 79(3): 506-523 (2018) - [j17]Oliver G. Czibula, Hanyu Gu
Planning personnel retraining: column generation heuristics. J. Comb. Optim. 36(3): 896-915 (2018) - [j16]Hanyu Gu
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms 52-53: 143-155 (2018) - [j15]Oliver G. Czibula
Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem. Theor. Comput. Sci. 718: 24-36 (2018) - [c8]Hanyu Gu
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach. WALCOM 2018: 119-131 - 2017
- [j14]Oliver G. Czibula
A multi-stage IP-based heuristic for class timetabling and trainer rostering. Ann. Oper. Res. 252(2): 305-333 (2017) - [c7]Hanyu Gu
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements. IWOCA 2017: 312-324 - 2016
- [j13]Oliver G. Czibula
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom. Comput. Oper. Res. 65: 53-63 (2016) - [j12]Joey Fung
Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2): 153-157 (2016) - [c6]Oliver G. Czibula, Hanyu Gu
Scheduling Personnel Retraining: Column Generation Heuristics. ISCO 2016: 213-224 - [c5]Oliver G. Czibula, Hanyu Gu
A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems. WALCOM 2016: 327-338 - 2015
- [j11]Yakov Zinder
Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness. Discret. Appl. Math. 196: 28-53 (2015) - [j10]Joey Fung
Capacity planning in supply chains of mineral resources. Inf. Sci. 316: 397-418 (2015) - 2013
- [j9]Yakov Zinder
Discrete optimization with polynomially detectable boundaries and restricted level sets. J. Comb. Optim. 25(2): 308-325 (2013) - [c4]Sam Walker, Yakov Zinder
The Solvable Cases of a Scheduling Algorithm. ISAAC 2013: 229-239 - [c3]Yakov Zinder
Scheduling Partially Ordered UET Tasks on Dedicated Machines. MIM 2013: 1672-1677 - 2010
- [c2]Yakov Zinder
Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets. COCOA (1) 2010: 142-156
2000 – 2009
- 2009
- [j8]Claire Hanen
The worst-case analysis of the Garey-Johnson algorithm. J. Sched. 12(4): 389-400 (2009) - 2006
- [c1]Yakov Zinder, Gaurav Singh, René Weiskircher:
A New Method of Scheduling UET Tasks on Parallel Machines. IMECS 2006: 796-801 - 2005
- [j7]Yakov Zinder
Preemptive Scheduling on Parallel Processors with due dates. Asia Pac. J. Oper. Res. 22(4): 445-462 (2005) - [j6]Yakov Zinder, Van Ha Do, Ceyda Oguz
Computational complexity of some scheduling problems with multiprocessor tasks. Discret. Optim. 2(4): 391-408 (2005) - 2004
- [j5]Ceyda Oguz
Hybrid flow-shop scheduling problems with multiprocessor task systems. Eur. J. Oper. Res. 152(1): 115-131 (2004) - 2003
- [j4]W. T. Huang, H. T. Nguyen, B. S. Thornton, Yakov Zinder:
Dynamic Programming Approach to Image Segmentation and its Application to Pre-processing of Mammograms. Aust. J. Intell. Inf. Process. Syst. 8(2): 51-56 (2003) - [j3]Yakov Zinder
An iterative algorithm for scheduling UET tasks with due dates and release times. Eur. J. Oper. Res. 149(2): 404-416 (2003) - 2000
- [j2]Peter Brucker, Sigrid Knust, Duncan Roper, Yakov Zinder
Scheduling UET task systems with concurrency on two parallel identical processors. Math. Methods Oper. Res. 52(3): 369-387 (2000)
1990 – 1999
- 1998
- [j1]Yakov Zinder, Duncan Roper:
An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness. Ann. Oper. Res. 81: 321-343 (1998)
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-12-10 20:51 CET 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: