|
Search the dblp DataBase
Yuri N. Sotskov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov
Heuristics for hybrid flow shops with controllable processing times and assignable due dates. [Citation Graph (0, 0)][DBLP] Computers & OR, 2002, v:29, n:10, pp:1417-1439 [Journal]
- Yuri N. Sotskov, V. K. Leontev, Evgenii N. Gordeev
Some Concepts of Stability Analysis in Combinatorial optimization. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:58, n:2, pp:169-190 [Journal]
- Yuri N. Sotskov, Natalia V. Shakhlevich
NP-hardness of Shop-scheduling Problems with Three Jobs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:59, n:3, pp:237-266 [Journal]
- Fawaz S. Al-Anzi, Yuri N. Sotskov, Ali Allahverdi, George V. Andreev
Using mixed graph coloring to minimize total completion time in job shop scheduling. [Citation Graph (0, 0)][DBLP] Applied Mathematics and Computation, 2006, v:182, n:2, pp:1137-1148 [Journal]
- Yuri N. Sotskov, Alexandre Dolgui, Marie-Claude Portmann
Stability analysis of an optimal balance for an assembly line with fixed cycle time. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:168, n:3, pp:783-797 [Journal]
- Tsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner
Mean flow time minimization with given bounds of processing times. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2004, v:159, n:3, pp:558-573 [Journal]
Scheduling two jobs with fixed and nonfixed routes. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|