The following pages link to Yakov M. Shafransky (Q210317):
Displaying 16 items.
- (Q247929) (redirect page) (← links)
- Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238) (← links)
- Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph (Q499331) (← links)
- An optimization algorithm for the clearing of interbank payments (Q819066) (← links)
- Batch scheduling with deadlines on parallel machines (Q1273116) (← links)
- Uniform machine scheduling of unit-time jobs subject to resource constraints (Q1392579) (← links)
- Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty (Q2215204) (← links)
- Lawler's minmax cost problem under uncertainty (Q2410026) (← links)
- (Q2712372) (← links)
- (Q2731287) (← links)
- (Q3416602) (← links)
- Scheduling for parallel dedicated machines with a single server (Q4488782) (← links)
- A note on the complexity of family scheduling to minimize the number of late jobs (Q5946721) (← links)
- Scheduling dedicated jobs with variative processing times (Q5963650) (← links)
