Zinder Yakov

Yakov Zinder

Information about the author Yakov Zinder will soon be added to the site.
Found 7 papers in total
Scheduling UET‐UCT tasks: branch‐and‐bound search in the priority space
Scheduling UET‐UCT tasks: branch‐and‐bound search in the priority space
2010
The paper is concerned with the problem of scheduling partially ordered unit execution...
The worst-case analysis of the Garey–Johnson algorithm
The worst-case analysis of the Garey–Johnson algorithm
2009
The Garey–Johnson algorithm is a well known polynomial-time algorithm...
Preemptive scheduling on parallel processors with due dates
Preemptive scheduling on parallel processors with due dates
2005
The paper presents a priority algorithm for the maximum lateness problem with parallel...
Hybrid flow-shop scheduling problems with multiprocessor task systems
Hybrid flow-shop scheduling problems with multiprocessor task systems
2004
Hybrid flow-shop problems and problems with multiprocessor task systems have remained...
An iterative algorithm for scheduling unit execution time tasks with due dates and release times
An iterative algorithm for scheduling unit execution time tasks with due dates and release times
2003
A new polynomial-time iterative algorithm is presented for the scheduling problem with...
Worst-case performance of two critical path type algorithms
Worst-case performance of two critical path type algorithms
2000
The critical path method remains one of the most popular approaches in practical...
An iterative algorithm for scheduling unit-time tasks with precedence constraints to minimise the maximum lateness
An iterative algorithm for scheduling unit-time tasks with precedence constraints to minimise the maximum lateness
1998
We consider the maximum lateness problem in which all tasks have the same execution...
Papers per page: