default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJerzy Kamburowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j21]Jerzy Kamburowski:
Corrigendum to "The distribution-free newsboy problem under the worst-case and best-case scenarios" [Eur. J. Oper. Res. 237(2014) 106-112]. Eur. J. Oper. Res. 240(1): 304 (2015)- [j20]Jerzy Kamburowski:
The distribution-free newsboy problem and the demand skew. Int. Trans. Oper. Res. 22(5): 929-946 (2015) - [j19]Jerzy Kamburowski:
On the distribution-free newsboy problem with some non-skewed demands. Oper. Res. Lett. 43(2): 165-171 (2015) - 2014
- [j18]Jerzy Kamburowski:
The distribution-free newsboy problem under the worst-case and best-case scenarios. Eur. J. Oper. Res. 237(1): 106-112 (2014) - 2012
- [j17]Pawel Jan Kalczynski
, Jerzy Kamburowski:
An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times. Comput. Oper. Res. 39(11): 2659-2665 (2012) - 2009
- [j16]Pawel Jan Kalczynski, Jerzy Kamburowski:
An empirical analysis of the optimality rate of flow shop heuristics. Eur. J. Oper. Res. 198(1): 93-101 (2009) - 2008
- [j15]Pawel Jan Kalczynski, Jerzy Kamburowski:
An improved NEH heuristic to minimize makespan in permutation flow shops. Comput. Oper. Res. 35(9): 3001-3008 (2008) - 2007
- [j14]Pawel Jan Kalczynski, Jerzy Kamburowski:
On no-wait and no-idle flow shops with makespan criterion. Eur. J. Oper. Res. 178(3): 677-685 (2007) - 2006
- [j13]Pawel Jan Kalczynski, Jerzy Kamburowski:
A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation. Eur. J. Oper. Res. 169(3): 742-750 (2006) - 2005
- [j12]Pawel Jan Kalczynski, Jerzy Kamburowski:
A heuristic for minimizing the makespan in no-idle permutation flow shops. Comput. Ind. Eng. 49(1): 146-154 (2005) - [j11]Pawel Jan Kalczynski, Jerzy Kamburowski:
Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem. J. Sched. 8(6): 529-536 (2005) - 2004
- [j10]Jerzy Kamburowski:
More on three-machine no-idle flow shops. Comput. Ind. Eng. 46(3): 461-466 (2004) - [j9]Pawel Jan Kalczynski, Jerzy Kamburowski:
Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops. J. Oper. Res. Soc. 55(12): 1358-1362 (2004) - 2000
- [j8]Jerzy Kamburowski:
On three-machine flow shops with random job processing times. Eur. J. Oper. Res. 125(2): 440-448 (2000) - [j7]Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann:
Minimizing the complexity of an activity network. Networks 36(1): 47-52 (2000) - 1999
- [j6]Jerzy Kamburowski:
Stochastically minimizing the makespan in two-machine flow shops without blocking. Eur. J. Oper. Res. 112(2): 304-309 (1999) - 1992
- [j5]Jerzy Kamburowski:
Bounding the distribution of project duration in PERT networks. Oper. Res. Lett. 12(1): 17-22 (1992) - [j4]Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann:
Optimal Reductions of Two-Terminal Directed Acyclic Graphs. SIAM J. Comput. 21(6): 1112-1129 (1992) - 1991
- [j3]Veena Adlakha, Barbara Gladysz, Jerzy Kamburowski:
Minimum flows in (s, t) planar networks. Networks 21(7): 767-773 (1991) - 1985
- [j2]Jerzy Kamburowski:
Technical Note - A Note on the Stochastic Shortest Route Problem. Oper. Res. 33(3): 696-698 (1985) - 1984
- [j1]Jerzy Kamburowski:
Some remarks on the expected delay of project duration in a PERT network. Z. Oper. Research 28(6) (1984)
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 23:17 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:
