default search action
Valery S. Gordon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j21]Alexandre Dolgui
, Valery S. Gordon, Vitaly A. Strusevich:
Single machine scheduling with precedence constraints and positionally dependent processing times. Comput. Oper. Res. 39(6): 1218-1224 (2012) - [j20]Jacek Blazewicz
Editorial: new branches, old roots. J. Sched. 15(4): 399-401 (2012) - [j19]Valery S. Gordon, Mikhail Y. Kovalyov
Vyacheslav Tanaev: contributions to scheduling and related areas. J. Sched. 15(4): 403-418 (2012) - [j18]Valery S. Gordon, Vitaly A. Strusevich, Alexandre Dolgui
Scheduling with due date assignment under special conditions on job processing. J. Sched. 15(4): 447-456 (2012) - 2011
- [j17]Yury L. Orlovich, Alexandre Dolgui
The complexity of dissociation set problems in graphs. Discret. Appl. Math. 159(13): 1352-1366 (2011) - [j16]Valery S. Gordon, Yury L. Orlovich, Chris N. Potts, Vitaly A. Strusevich:
Hamiltonian properties of locally connected graphs with bounded vertex degree. Discret. Appl. Math. 159(16): 1759-1774 (2011) - [j15]Yury L. Orlovich, Jacek Blazewicz
On the complexity of the independent set problem in triangle graphs. Discret. Math. 311(16): 1670-1680 (2011)
2000 – 2009
- 2009
- [j14]Valery S. Gordon, Alexander Tarasevich:
A note: Common due date assignment for a single machine scheduling with the rate-modifying activity. Comput. Oper. Res. 36(2): 325-328 (2009) - [j13]Valery S. Gordon, Vitaly A. Strusevich:
Single machine scheduling and due date assignment with positionally dependent processing times. Eur. J. Oper. Res. 198(1): 57-62 (2009) - [j12]Yury L. Orlovich, Valery S. Gordon, Dominique de Werra:
On the inapproximability of independent domination in 2P3-free perfect graphs. Theor. Comput. Sci. 410(8-10): 977-982 (2009) - 2008
- [j11]Yury L. Orlovich, Gerd Finke, Valery S. Gordon, Igor E. Zverovich:
Approximability results for the maximum and minimum maximal induced matching problems. Discret. Optim. 5(3): 584-593 (2008) - [j10]Valery S. Gordon, Yury L. Orlovich, Frank Werner
Hamiltonian properties of triangular grid graphs. Discret. Math. 308(24): 6166-6188 (2008) - [j9]Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich, J. Douglass Whitehead:
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J. Sched. 11(5): 357-370 (2008) - 2007
- [j8]Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich:
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints. Electron. Notes Discret. Math. 29: 169-173 (2007) - [j7]Satyaveer Singh Chauhan, Valery S. Gordon, Jean-Marie Proth:
Scheduling in supply chain environment. Eur. J. Oper. Res. 183(3): 961-970 (2007) - 2006
- [j6]Alexandre Dolgui
Guest Editorial - Discrete Optimization Methods in Production and Logistics. J. Math. Model. Algorithms 5(2): 139-141 (2006) - [j5]Vitali M. Demidenko, Gerd Finke, Valery S. Gordon:
Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices. J. Math. Model. Algorithms 5(2): 167-187 (2006) - 2005
- [c3]Valery S. Gordon, Alexander Tarasevich:
On a Single Machine Due Date Assignment and Scheduling Problem with the Rate-Modifying Activity. OR 2005: 679-684 - 2004
- [r1]Valery S. Gordon, Jean-Marie Proth, Vitaly A. Strusevich:
Scheduling with Due Date Assignment. Handbook of Scheduling 2004 - 2002
- [j4]Valery S. Gordon, Jean-Marie Proth, Chengbin Chu
A survey of the state-of-the-art of common due date assignment and scheduling research. Eur. J. Oper. Res. 139(1): 1-25 (2002) - 2001
- [j3]Valery S. Gordon, Frank Werner
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals. RAIRO Oper. Res. 35(1): 71-83 (2001) - [c2]Valery S. Gordon, Jean-Marie Proth, Gerd Finke, Chengbin Chu:
Scheduling with common due date assignment. ETFA (1) 2001: 553-557
1990 – 1999
- 1999
- [j2]Valery S. Gordon, Vitaly A. Strusevich:
Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Comput. Oper. Res. 26(2): 157-177 (1999) - [c1]Valery S. Gordon, Jean-Marie Proth, Chengbin Chu:
Parallel Machine Scheduling with Common Due Date. Applied Informatics 1999: 444-446 - 1998
- [j1]Valery S. Gordon, Wieslaw Kubiak:
Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs. Inf. Process. Lett. 68(3): 153-159 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: