The following pages link to Yuri N. Sotskov (Q367242):
Displayed 37 items.
- (Q3835477) (← links)
- (Q3879282) (← links)
- (Q3890738) (← links)
- (Q3933007) (← links)
- (Q3952120) (← links)
- (Q3952121) (← links)
- (Q3994687) (← links)
- (Q4006771) (← links)
- Complexity of optimal scheduling problems with three jobs (Q4007431) (← links)
- (Q4012340) (← links)
- (Q4012341) (← links)
- (Q4120593) (← links)
- (Q4123353) (← links)
- (Q4124589) (← links)
- (Q4205230) (← links)
- Heuristics for generalized shop scheduling problems based on decomposition (Q4245699) (← links)
- (Q4246525) (← links)
- (Q4247059) (← links)
- Mixed multigraph approach to scheduling jobs on machines of different types<sup>∗</sup> (Q4375439) (← links)
- On the application of insertion techniques for job shop problems with setup times (Q4497862) (← links)
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times (Q4661102) (← links)
- (Q4667415) (← links)
- Stability of Johnson's schedule with respect to limited machine availability (Q4706332) (← links)
- (Q4732298) (← links)
- (Q4766994) (← links)
- (Q4789917) (← links)
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times (Q4806914) (← links)
- (Q4836308) (← links)
- Optimal schedules with infinitely large stability radius<sup>∗</sup> (Q4836770) (← links)
- (Q4840995) (← links)
- (Q4841008) (← links)
- (Q4841579) (← links)
- A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs (Q4868791) (← links)
- (Q4882997) (← links)
- Adaptive scheduling algorithm based on mixed graph model (Q4885771) (← links)
- Optimality of Jackson's permutations with respect to limited machine availability (Q5488246) (← links)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)