default search action
Dan Trietsch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j21]Kenneth R. Baker, Dan Trietsch:
Trading off due-date tightness and job tardiness in a basic scheduling model. J. Sched. 18(3): 305-309 (2015) - 2012
- [j20]Dan Trietsch, Lilit Mazmanyan, Lilit Gevorgyan, Kenneth R. Baker:
Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation. Eur. J. Oper. Res. 216(2): 386-396 (2012) - 2011
- [j19]Kenneth R. Baker, Dan Trietsch:
Three heuristic procedures for the stochastic, two-machine flow shop problem. J. Sched. 14(5): 445-454 (2011) - 2010
- [j18]Dan Trietsch:
Optimal Crashing and Buffering of Stochastic Serial Projects. Int. J. Inf. Technol. Proj. Manag. 1(1): 30-41 (2010)
2000 – 2009
- 2009
- [j17]Kenneth R. Baker, Dan Trietsch:
Safe scheduling: Setting due dates in single-machine problems. Eur. J. Oper. Res. 196(1): 69-77 (2009) - 2008
- [j16]Dan Trietsch, Kenneth R. Baker:
Minimizing the number of tardy jobs with stochastically-ordered processing times. J. Sched. 11(1): 71-73 (2008) - 2006
- [j15]Victor Portougal, Dan Trietsch:
Setting due dates in a stochastic single machine environment. Comput. Oper. Res. 33: 1681-1694 (2006) - [j14]Victor Portougal, Dan Trietsch:
Johnson's problem with stochastic processing times and optimal service level. Eur. J. Oper. Res. 169(3): 751-760 (2006) - 2005
- [j13]Dan Trietsch, Rajendra Akerkar:
The Think-Piece: Scientific Publishing in the Global Electronic Village Some Thoughts. Int. J. Comput. Sci. Appl. 2(2): 1-4 (2005) - 2001
- [j12]Victor Portougal, Dan Trietsch:
Stochastic scheduling with optimal customer service. J. Oper. Res. Soc. 52(2): 226-233 (2001)
1990 – 1999
- 1999
- [j11]David J. Robb
, Dan Trietsch:
Maximizing the number of mixed packages subject to variety constraints. Comput. Oper. Res. 26(13): 1323-1333 (1999) - [j10]Dan Trietsch, J. F. Weng:
Pseudo-Gilbert-Steiner trees. Networks 33(3): 175-178 (1999) - 1998
- [j9]Victor Portougal, Dan Trietsch:
Makespan-related criteria for comparing schedules in stochastic environments. J. Oper. Res. Soc. 49(11): 1188-1195 (1998) - 1993
- [j8]Dan Trietsch, Kenneth R. Baker:
Basic Techniques for Lot Streaming. Oper. Res. 41(6): 1065-1076 (1993) - [j7]Dan Trietsch:
Optimal multifacility defensive location on planes with rectilinear distances. Networks 23(6): 517-523 (1993) - 1990
- [j6]Dan Trietsch:
Interconnecting networks in the plane: The steiner case. Networks 20(1): 93-108 (1990)
1980 – 1989
- 1988
- [j5]Boaz Ronen, Dan Trietsch:
A Decision Support System for Purchasing Management of Large Projects: Special Focus Article. Oper. Res. 36(6): 882-890 (1988) - 1987
- [j4]Dan Trietsch:
A Family of Methods for Preliminary Highway Alignment. Transp. Sci. 21(1): 17-25 (1987) - [j3]Dan Trietsch:
Comprehensive Design of Highway Networks. Transp. Sci. 21(1): 26-35 (1987) - 1985
- [j2]Dan Trietsch, Gabriel Y. Handler:
The Gilbert and Pollak conjecture - a generalization. Networks 15(3): 365-380 (1985) - [j1]Dan Trietsch, Gabriel Y. Handler:
On Highway Fuel and Time Expenditures. Transp. Sci. 19(3): 293-307 (1985)
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:52 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: