The following pages link to Ya. M. Shafransky (Q612204):
Displayed 35 items.
- Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary (Q612205) (← links)
- (Q757231) (redirect page) (← links)
- Parallel machines scheduling with nonsimultaneous machine available time (Q757232) (← links)
- Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575) (← links)
- A probabilistic analysis of the multiknapsack value function (Q909581) (← links)
- A new formulation and solution of the flowshop scheduling problem with no in-process waiting (Q1090230) (← links)
- Single facility scheduling with multiple job classes (Q1105481) (← links)
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine (Q1178637) (← links)
- Parametric bounds for LPT scheduling on uniform processors (Q1179414) (← links)
- Scheduling around a small common due date (Q1183621) (← links)
- Single machine scheduling with coefficient of variation minimization (Q1205688) (← links)
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020) (← links)
- Constructive heuristic algorithms for the open shop problem (Q1310611) (← links)
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs (Q1326784) (← links)
- Lot streaming in three-stage production processes (Q1331614) (← links)
- Group-theoretic method of decomposition methods in integer linear programming (Q1802604) (← links)
- Structure of a simple scheduling polyhedron (Q1803611) (← links)
- The two-machine flow shop problem with arbitrary precedence relations (Q2366083) (← links)
- (Q3161327) (← links)
- (Q3216391) (← links)
- (Q3494361) (← links)
- (Q3661320) (← links)
- The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets (Q3765559) (← links)
- Parametric problem in scheduling theory (Q3904366) (← links)
- (Q3962764) (← links)
- (Q3973085) (← links)
- (Q4012350) (← links)
- (Q4012351) (← links)
- (Q4128241) (← links)
- (Q4168758) (← links)
- (Q4168759) (← links)
- (Q4177303) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- NP-completeness of some optimal sequencing problems with a given grouping of elements (Q4723552) (← links)
- (Q4745641) (← links)