default search action
Tadeusz Sawik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Tadeusz Sawik
:
A new MIP approach for balancing and scheduling of mixed model assembly lines with alternative precedence relations. Int. J. Prod. Res. 62(1-2): 110-121 (2024) - [j21]Tadeusz Sawik
Risk-averse decision-making to maintain supply chain viability under propagated disruptions. Int. J. Prod. Res. 62(8): 2853-2867 (2024) - 2023
- [j20]Tadeusz Sawik
A stochastic optimisation approach to maintain supply chain viability under the ripple effect. Int. J. Prod. Res. 61(8): 2452-2469 (2023) - 2022
- [j19]Tadeusz Sawik
Balancing cybersecurity in a supply chain under direct and indirect cyber risks. Int. J. Prod. Res. 60(2): 766-782 (2022) - [j18]Tadeusz Sawik
A linear model for optimal cybersecurity investment in Industry 4.0 supply chains. Int. J. Prod. Res. 60(4): 1368-1385 (2022) - [j17]Tadeusz Sawik
A rough cut cybersecurity investment using portfolio of security controls with maximum cybersecurity value. Int. J. Prod. Res. 60(21): 6556-6572 (2022) - 2020
- [j16]Tadeusz Sawik
A two-period model for selection of resilient multi-tier supply portfolio. Int. J. Prod. Res. 58(19): 6043-6060 (2020)
2010 – 2019
- 2019
- [j15]Tadeusz Sawik
Two-period vs. multi-period model for supply chain disruption management. Int. J. Prod. Res. 57(14): 4502-4518 (2019) - 2018
- [j14]Tadeusz Sawik
Selection of a dynamic supply portfolio under delay and disruption risks. Int. J. Prod. Res. 56(1-2): 760-782 (2018) - 2017
- [j13]Tadeusz Sawik
A portfolio approach to supply chain disruption management. Int. J. Prod. Res. 55(7): 1970-1991 (2017) - 2014
- [j12]Tadeusz Sawik
Optimization of cost and service level in the presence of supply chain disruption risks: Single vs. multiple sourcing. Comput. Oper. Res. 51: 11-20 (2014) - 2013
- [j11]Tadeusz Sawik
Selection of optimal countermeasure portfolio in IT security planning. Decis. Support Syst. 55(1): 156-164 (2013) - 2011
- [j10]Tadeusz Sawik
Selection of a dynamic supply portfolio in make-to-order environment withrisks. Comput. Oper. Res. 38(4): 782-796 (2011) - [j9]Tadeusz Sawik
Supplier selection in make-to-order environment with risks. Math. Comput. Model. 53(9-10): 1670-1679 (2011)
2000 – 2009
- 2007
- [j8]Tadeusz Sawik
A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing. Eur. J. Oper. Res. 180(3): 1060-1075 (2007) - [j7]Tadeusz Sawik:
A multi-objective customer orders assignment and resource leveling in make-to-order manufacturing. Int. Trans. Oper. Res. 14(6): 491-508 (2007) - [j6]Tadeusz Sawik
Integer programming approach to reactive scheduling in make-to-order manufacturing. Math. Comput. Model. 46(11-12): 1373-1387 (2007) - 2005
- [j5]Tadeusz Sawik
Integer programming approach to production scheduling for make-to-order manufacturing. Math. Comput. Model. 41(1): 99-118 (2005) - [j4]Tadeusz Sawik
A cyclic versus flexible approach to materials ordering in make-to-order assembly. Math. Comput. Model. 42(3-4): 279-290 (2005) - 2004
- [j3]Tadeusz Sawik
Loading and scheduling of a flexible assembly system by mixed integer programming. Eur. J. Oper. Res. 154(1): 1-19 (2004) - 2002
- [j2]Tadeusz Sawik
Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line. Eur. J. Oper. Res. 143(1): 115-124 (2002)
1990 – 1999
- 1998
- [j1]Tadeusz Sawik
A lexicographic approach to bi-objective loading of a flexible assembly system. Eur. J. Oper. Res. 107(3): 656-668 (1998)
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-05-06 20:24 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: