default search action
Stefan Chanas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
- [j16]Stefan Chanas, Adam Kasperski
:
Sensitivity analysis in the single-machine scheduling problem with max-min criterion. Int. Trans. Oper. Res. 12(3): 287-298 (2005) - 2004
- [j15]Stefan Chanas, Adam Kasperski
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters. Fuzzy Sets Syst. 142(3): 359-371 (2004) - 2003
- [j14]Stefan Chanas, Adam Kasperski
On two single machine scheduling problems with fuzzy processing times and fuzzy due dates. Eur. J. Oper. Res. 147(2): 281-296 (2003) - [j13]Stefan Chanas, Pawel Zielinski
On the hardness of evaluating criticality of activities in a planar network with duration intervals. Oper. Res. Lett. 31(1): 53-59 (2003) - 2002
- [j12]Stefan Chanas, Pawel Zielinski
The computational complexity of the criticality problems in a network with interval activity times. Eur. J. Oper. Res. 136(3): 541-550 (2002) - [j11]Stefan Chanas, Didier Dubois, Pawel Zielinski
On the sure criticality of tasks in activity networks with imprecise durations. IEEE Trans. Syst. Man Cybern. Part B 32(4): 393-407 (2002) - 2001
- [j10]Stefan Chanas, Pawel Zielinski
Critical path analysis in the network with fuzzy activity times. Fuzzy Sets Syst. 122(2): 195-204 (2001) - [j9]Stefan Chanas:
On the interval approximation of a fuzzy number. Fuzzy Sets Syst. 122(2): 353-356 (2001) - [c3]Stefan Chanas, Dorota Kuchta:
A new approach to fuzzy goal programming. EUSFLAT Conf. 2001: 199-201 - [c2]Stefan Chanas, Didier Dubois, Pawel Zielinski:
Criticality analysis in activity networks under incomplete information. EUSFLAT Conf. 2001: 233-236 - [c1]Stefan Chanas, Adam Kasperski:
Possible optimality of solutions in a single machine scheduling problem with fuzzy parameters. EUSFLAT Conf. 2001: 245-248 - 2000
- [j8]Stefan Chanas, Pawel Zielinski
On the equivalence of two optimization methods for fuzzy linear programming problems. Eur. J. Oper. Res. 121(1): 56-63 (2000)
1990 – 1999
- 1999
- [j7]Stefan Chanas, Pawel Zielinski
Ranking Fuzzy Interval Numbers in the Setting of Random Sets - Further Results. Inf. Sci. 117(3-4): 191-200 (1999) - 1998
- [j6]Stefan Chanas, Dorota Kuchta:
An algorithm for solving bicriterial linear programmingproblems with parametrical coefficients in theobjective functions. Ann. Oper. Res. 81: 63-72 (1998) - [j5]Stefan Chanas, Dorota Kuchta:
Fuzzy integer transportation problem. Fuzzy Sets Syst. 98(3): 291-298 (1998) - 1996
- [j4]Stefan Chanas, Przemyslaw Kobylanski:
A new heuristic algorithm solving the linear ordering problem. Comput. Optim. Appl. 6(2): 191-205 (1996) - [j3]Stefan Chanas, Dorota Kuchta:
A concept of the optimal solution of the transportation problem with fuzzy cost coefficients. Fuzzy Sets Syst. 82(3): 299-305 (1996) - 1993
- [j2]Stefan Chanas, Miguel Delgado, José L. Verdegay, María Amparo Vila Miranda
Ranking fuzzy interval numbers in the setting of random sets. Inf. Sci. 69(3): 201-217 (1993)
1980 – 1989
- 1986
- [j1]Stefan Chanas, Waldemar Kolodziejczyk:
Integer flows in network with fuzzy capacity constraints. Networks 16(1): 17-31 (1986)
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-24 22:57 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: