The following pages link to Yakov Zinder (Q342112):
Displaying 35 items.
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
- Scheduling UET-UCT tasks: Branch-and-bound search in the priority space (Q622602) (← links)
- (Q828063) (redirect page) (← links)
- Rescheduling traffic on a partially blocked segment of railway with a siding (Q828064) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness (Q1265894) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- Scheduling UET task systems with concurrency on two parallel identical processors (Q1401638) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- Planning personnel retraining: column generation heuristics (Q1631648) (← links)
- Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach (Q1641106) (← links)
- Scheduling the two-way traffic on a single-track railway with a siding (Q1647296) (← links)
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem (Q1705774) (← links)
- Permutation schedules for a two-machine flow shop with storage (Q1785731) (← links)
- Discrete optimization with polynomially detectable boundaries and restricted level sets (Q1944392) (← links)
- Planning rolling stock maintenance: optimization of train arrival dates at a maintenance center (Q2076349) (← links)
- An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search (Q2147119) (← links)
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603) (← links)
- Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics (Q2181771) (← links)
- A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (Q2230732) (← links)
- The worst-case analysis of the Garey-Johnson algorithm (Q2268512) (← links)
- A multi-stage IP-based heuristic for class timetabling and trainer rostering (Q2398428) (← links)
- Flexible flow shop with dedicated buffers (Q2414462) (← links)
- A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems (Q2803836) (← links)
- Scheduling Personnel Retraining: Column Generation Heuristics (Q2835678) (← links)
- The Solvable Cases of a Scheduling Algorithm (Q2872088) (← links)
- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets (Q3066152) (← links)
- (Q4546239) (← links)
- Estimation of biochemical parameters from leaf photosynthesis (Q4638473) (← links)
- (Q5702311) (← links)
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES (Q5716131) (← links)
- Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements (Q5915649) (← links)
- Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements (Q5915911) (← links)
- A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty (Q6114962) (← links)
- Algorithms for flow shop with job-dependent buffer requirements (Q6629020) (← links)
