The following pages link to Yuri N. Sotskov (Q367242):
Displaying 50 items.
- Scheduling personal finances via integer programming (Q367243) (← links)
- (Q612202) (redirect page) (← links)
- Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary (Q612205) (← links)
- Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
- Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- A neural network algorithm for servicing jobs with sequential and parallel machines (Q893921) (← links)
- Stability polyhedra of optimal permutation of jobs servicing (Q893928) (← links)
- Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
- The complexity of shop-scheduling problems with two or three jobs (Q1178530) (← links)
- Stability of an optimal schedule (Q1183618) (← links)
- On the calculation of the stability radius of an optimal or an approximate schedule (Q1273126) (← links)
- Preemptive job-shop scheduling problems with a fixed number of jobs (Q1299919) (← links)
- Scheduling two jobs with fixed and nonfixed routes (Q1316587) (← links)
- The stability of the approximate Boolean minimization of a linear form (Q1323967) (← links)
- Stability of a schedule minimizing mean flow time (Q1362250) (← links)
- On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404) (← links)
- (Q1381775) (redirect page) (← links)
- Optimal makespan scheduling with given bounds of processing times (Q1381777) (← links)
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times (Q1415102) (← links)
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates (Q1603337) (← links)
- The stability radius of an optimal line balance with maximum efficiency for a simple assembly line (Q1634287) (← links)
- Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
- Some concepts of stability analysis in combinatorial optimization (Q1805456) (← links)
- Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
- Mean flow time minimization with given bounds of processing times (Q1887954) (← links)
- NP-hardness of shop-scheduling problems with three jobs (Q1893158) (← links)
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs (Q1960324) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- Single machine scheduling problem with interval processing times and total completion time objective (Q2283853) (← links)
- Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines (Q2290308) (← links)
- Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
- Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
- Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)
- Stability analysis of an optimal balance for an assembly line with fixed cycle time (Q2569066) (← links)
- (Q2712373) (← links)
- (Q2784175) (← links)
- The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (Q3111147) (← links)
- Scheduling Problems and Mixed Graph Colorings (Q3150263) (← links)
- Sequencing with uncertain numerical data for makespan minimisation (Q3157317) (← links)
- (Q3359982) (← links)
- (Q3362081) (← links)
- (Q3477568) (← links)
- (Q3483071) (← links)
- The stability of high-speed optimal schedules (Q3487124) (← links)
- (Q3598878) (← links)
- (Q3712139) (← links)
- (Q3765544) (← links)
- (Q3807867) (← links)
- (Q3824093) (← links)
