4 citations · 4 across the 3 of their papers we have counts for
3 papers
Minimum-weight partitioning of a set with associated subsets
Yakov Zinder, Bertrand M. T. Lin, Joanna Berlińska
The paper presents complexity results and performance guaranties for a family of approximation algorithms for an optimisation problem arising in software testing and manufacturing.…
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
Alexander Kononov, Julia Memar, Yakov Zinder
The paper is concerned with the two-machine flow shop, where each job requires an additional resource (referred to as storage space) from the start of its first operation till the…
Maximising the total weight of on-time jobs on parallel machines subject to a conflict graph
Yakov Zinder, Joanna Berlińska, Charlie Peter
The paper considers scheduling on parallel machines under the constraint that some pairs of jobs cannot be processed concurrently. Each job has an associated weight, and all jobs h…